Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listSep 3, 2026 12:56Josu San MartinJosu San MartinScore: 3,339Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 12:583,32737,372,59826,229,0001,058,0002,113,536
2Sep 3, 2026 12:583,33037,429,63626,246,0001,064,0002,113,536
3Sep 3, 2026 12:583,33437,491,38526,272,0001,072,0002,113,536
4Sep 3, 2026 12:583,33737,452,72326,311,0001,057,0002,113,536
5Sep 3, 2026 12:583,33937,432,17226,299,0001,081,0002,113,536
6Sep 3, 2026 12:583,34237,522,39326,348,0001,063,0002,113,536
7Sep 3, 2026 12:583,36138,446,12726,472,0001,089,0002,113,536
8Sep 3, 2026 12:583,38538,642,98026,657,0001,103,0002,113,536
9Sep 3, 2026 12:5813,681122,279,442111,119,0001,068,0002,113,536