Skip to content

Instantly share code, notes, and snippets.


Block or report user

Report or block unserializable

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
unserializable /
Created Jun 1, 2017
Sum even Fibonacci numbers not exceeding 4 million (Project Euler Problem #2)
Minimalistic (length-wise) looping Java code for Project Euler problem #2 (
Finds the sum of /even/ Fibonacci numbers which do not exceed 4 million.
^= operater use for variable swap in Java cannot be as compact as in C, see:
@author Taimo Peelo
public class SumEvenFibo_lt_4M {
public static void main(String[] args) { // Output is 4613732
unserializable /
Created Jan 13, 2017
Temporal play, with Friday the 13th example.
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.time.*;
import java.time.format.DateTimeFormatter;
import java.time.temporal.ChronoUnit;
import java.time.temporal.TemporalQuery;
import static java.time.DayOfWeek.FRIDAY;
import static java.time.temporal.ChronoField.DAY_OF_MONTH;
unserializable /
Last active Jan 9, 2017
Lists the enabled / available ciphersuites from the running JDK
import java.util.Set;
import static;
import static;
* @author Taimo Peelo
public class JdkTlsCipherSuiteList {
You can’t perform that action at this time.