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 5, 2026 00:38Josu San MartinJosu San MartinScore: 3,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 01:023,00534,635,69023,612,0001,034,0002,121,728stderr
2Sep 5, 2026 01:023,03034,811,61523,826,0001,024,0002,121,728stderr
3Sep 5, 2026 01:023,03135,651,26523,828,0001,027,0002,121,728stderr
4Sep 5, 2026 01:023,03334,793,34623,849,0001,022,0002,121,728stderr
5Sep 5, 2026 01:023,04435,690,70323,937,0001,025,0002,121,728stderr
6Sep 5, 2026 01:023,05435,743,44224,015,0001,033,0002,121,728stderr
7Sep 5, 2026 01:023,07436,000,65324,177,0001,036,0002,121,728stderr
8Sep 5, 2026 01:023,08035,258,46624,226,0001,031,0002,121,728stderr
9Sep 5, 2026 01:0215,217134,725,228123,769,0001,012,0002,121,728stderr