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 listMay 7, 2026 20:00Pavel SkripkinPavel SkripkinScore: 7,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 20:017,01373,348,93950,142,0007,367,0002,363,392
2May 7, 2026 20:017,21876,111,16850,965,0008,230,0002,424,832
3May 7, 2026 20:017,26174,071,56051,817,0007,727,0002,519,040
4May 7, 2026 20:017,28576,997,61851,514,0008,231,0002,527,232
5May 7, 2026 20:017,40474,531,41252,119,0008,599,0002,322,432
6May 7, 2026 20:017,42875,995,03552,288,0008,627,0002,424,832
7May 7, 2026 20:017,47075,514,66852,243,0009,017,0002,363,392
8May 7, 2026 20:017,50878,405,32253,056,0008,511,0002,494,464
9May 7, 2026 20:017,62978,374,26353,580,0008,982,0002,449,408