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:30Josu San MartinJosu San MartinScore: 3,059Success
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:363,02734,728,09323,794,0001,032,0002,121,728stderr
2Sep 5, 2026 00:363,03334,804,40423,848,0001,025,0002,121,728stderr
3Sep 5, 2026 00:363,04034,878,56123,910,0001,021,0002,121,728stderr
4Sep 5, 2026 00:363,04234,913,54523,918,0001,030,0002,121,728stderr
5Sep 5, 2026 00:363,05935,821,54324,065,0001,025,0002,121,728stderr
6Sep 5, 2026 00:363,12136,287,10124,562,0001,031,0002,121,728stderr
7Sep 5, 2026 00:3615,243134,981,956123,995,0001,005,0002,121,728stderr
8Sep 5, 2026 00:3615,283135,352,740124,297,0001,024,0002,121,728stderr
9Sep 5, 2026 00:3615,302135,423,431124,472,0001,005,0002,121,728stderr