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 19, 2026 18:12Andrew EpsteinAndrew EpsteinScore: 39,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 18:1323,862206,091,974191,533,0004,142,0002,121,728stderr
2Sep 19, 2026 18:1338,601326,992,202312,411,0004,124,0002,121,728stderr
3Sep 19, 2026 18:1338,971330,057,656315,447,0004,122,0002,121,728stderr
4Sep 19, 2026 18:1339,358333,218,983318,548,0004,194,0002,121,728stderr
5Sep 19, 2026 18:1339,455334,090,765319,376,0004,161,0002,121,728stderr
6Sep 19, 2026 18:1339,475334,255,075319,571,0004,130,0002,121,728stderr
7Sep 19, 2026 18:1339,763336,571,875321,943,0004,116,0002,121,728stderr
8Sep 19, 2026 18:1339,816336,981,255322,288,0004,211,0002,121,728stderr
9Sep 19, 2026 18:1340,055338,933,011324,254,0004,202,0002,117,632stderr