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 10, 2026 10:11Pavel SkripkinPavel SkripkinScore: 26,209Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:124,43350,244,60833,006,0003,346,0002,371,584
2May 10, 2026 10:124,48050,918,32932,677,0004,066,0002,445,312
3May 10, 2026 10:1225,838226,269,773207,835,0004,040,0002,482,176
4May 10, 2026 10:1225,929226,734,733209,603,0003,021,0002,392,064
5May 10, 2026 10:1226,209230,434,333211,634,0003,286,0002,318,336
6May 10, 2026 10:1226,322231,712,355212,738,0003,107,0002,531,328
7May 10, 2026 10:1226,360229,531,487213,132,0003,021,0002,379,776
8May 10, 2026 10:1226,380232,954,629213,126,0003,193,0002,543,616
9May 10, 2026 10:1226,877236,139,080216,367,0004,027,0002,334,720