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:18Andrew EpsteinAndrew EpsteinScore: 17,242Success
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:192,73631,264,81021,354,0001,088,00020,480
2Sep 19, 2026 18:192,74331,368,82721,397,0001,101,00020,480
3Sep 19, 2026 18:192,75031,573,92721,506,0001,051,00020,480
4Sep 19, 2026 18:1917,226149,875,319140,236,0001,018,00020,480
5Sep 19, 2026 18:1917,242150,205,266140,348,0001,039,00020,480
6Sep 19, 2026 18:1917,334150,961,095141,100,0001,039,00020,480
7Sep 19, 2026 18:1917,450151,936,300142,047,0001,045,00020,480
8Sep 19, 2026 18:1917,554152,765,303142,864,0001,086,00020,480
9Sep 19, 2026 18:1917,797154,788,327144,916,0001,020,00020,480