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 07:18Josu San MartinJosu San MartinScore: 3,090Success
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 07:193,05835,005,02724,046,0001,031,0002,121,728stderr
2Sep 4, 2026 07:193,06435,129,03124,103,0001,025,0002,121,728stderr
3Sep 4, 2026 07:193,07535,381,46924,193,0001,028,0002,121,728stderr
4Sep 4, 2026 07:193,07635,160,18824,197,0001,027,0002,121,728stderr
5Sep 4, 2026 07:193,09035,942,97824,291,0001,053,0002,121,728stderr
6Sep 4, 2026 07:1915,242134,921,999123,977,0001,012,0002,121,728stderr
7Sep 4, 2026 07:1915,243136,397,137123,970,0001,026,0002,121,728stderr
8Sep 4, 2026 07:1915,264135,207,085124,160,0001,006,0002,121,728stderr
9Sep 4, 2026 07:1915,280136,051,336124,262,0001,035,0002,121,728stderr