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:16Josu San MartinJosu San MartinScore: 3,077Success
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:173,06235,715,10724,083,0001,027,0002,121,728stderr
2Sep 4, 2026 06:173,06635,745,32224,091,0001,051,0002,121,728stderr
3Sep 4, 2026 06:173,07635,218,06124,199,0001,026,0002,121,728stderr
4Sep 4, 2026 06:173,07635,876,04024,172,0001,053,0002,121,728stderr
5Sep 4, 2026 06:173,07736,291,17924,179,0001,053,0002,121,728stderr
6Sep 4, 2026 06:173,08135,939,54024,243,0001,028,0002,121,728stderr
7Sep 4, 2026 06:173,08436,627,29224,260,0001,034,0002,121,728stderr
8Sep 4, 2026 06:173,09436,039,16024,342,0001,029,0002,121,728stderr
9Sep 4, 2026 06:1715,282135,247,879124,311,0001,005,0002,121,728stderr