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 4, 2026 06:43Josu San MartinJosu San MartinScore: 3,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 06:453,04735,610,56023,947,0001,041,0002,121,728stderr
2Sep 4, 2026 06:453,06135,011,51924,052,0001,052,0002,121,728stderr
3Sep 4, 2026 06:453,06535,869,32024,102,0001,032,0002,121,728stderr
4Sep 4, 2026 06:453,06635,882,36524,119,0001,026,0002,121,728stderr
5Sep 4, 2026 06:453,07235,868,34324,168,0001,030,0002,121,728stderr
6Sep 4, 2026 06:453,08235,974,40524,222,0001,051,0002,121,728stderr
7Sep 4, 2026 06:453,08435,966,50924,262,0001,034,0002,121,728stderr
8Sep 4, 2026 06:453,08535,938,67824,275,0001,028,0002,121,728stderr
9Sep 4, 2026 06:4515,226134,824,353123,852,0001,005,0002,121,728stderr