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 06:51Josu San MartinJosu San MartinScore: 3,080Success
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 06:523,05034,956,17323,992,0001,022,0002,121,728stderr
2Sep 4, 2026 06:523,06435,875,20724,106,0001,026,0002,121,728stderr
3Sep 4, 2026 06:523,06936,273,09624,120,0001,053,0002,121,728stderr
4Sep 4, 2026 06:523,07636,315,68124,193,0001,034,0002,121,728stderr
5Sep 4, 2026 06:523,08035,287,12324,228,0001,033,0002,121,728stderr
6Sep 4, 2026 06:523,09035,460,70624,300,0001,038,0002,121,728stderr
7Sep 4, 2026 06:5215,204134,642,920123,640,0001,035,0002,121,728stderr
8Sep 4, 2026 06:5215,240135,027,160123,964,0001,006,0002,121,728stderr
9Sep 4, 2026 06:5215,278135,978,435124,276,0001,006,0002,121,728stderr