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 5, 2026 00:32Josu San MartinJosu San MartinScore: 3,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 00:423,03234,833,05723,850,0001,020,0002,121,728stderr
2Sep 5, 2026 00:423,04034,884,97723,905,0001,025,0002,121,728stderr
3Sep 5, 2026 00:423,05334,995,67124,018,0001,024,0002,121,728stderr
4Sep 5, 2026 00:423,06535,190,77724,084,0001,050,0002,121,728stderr
5Sep 5, 2026 00:423,06835,078,09124,045,0001,116,0002,121,728stderr
6Sep 5, 2026 00:423,07935,277,80224,097,0001,153,0002,121,728stderr
7Sep 5, 2026 00:423,08635,308,70924,129,0001,181,0002,121,728stderr
8Sep 5, 2026 00:4215,298135,490,336124,444,0001,007,0002,121,728stderr
9Sep 5, 2026 00:4215,305135,508,753124,489,0001,017,0002,121,728stderr