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 00:06Josu San MartinJosu San MartinScore: 3,078Success
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 00:063,05334,995,07924,018,0001,023,0002,121,728stderr
2Sep 4, 2026 00:063,05635,082,23524,046,0001,020,0002,121,728stderr
3Sep 4, 2026 00:063,06035,053,24424,044,0001,049,0002,121,728stderr
4Sep 4, 2026 00:063,07035,346,01524,149,0001,028,0002,121,728stderr
5Sep 4, 2026 00:063,07835,178,47524,218,0001,025,0002,121,728stderr
6Sep 4, 2026 00:063,08036,045,63324,232,0001,026,0002,121,728stderr
7Sep 4, 2026 00:063,08535,318,45324,276,0001,024,0002,121,728stderr
8Sep 4, 2026 00:0614,354127,694,909116,697,0001,006,0002,121,728stderr
9Sep 4, 2026 00:0614,433128,349,361117,335,0001,017,0002,121,728stderr