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 3, 2026 21:58Josu San MartinJosu San MartinScore: 4,022Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 21:593,98042,602,58731,618,0001,026,0002,121,728stderr
2Sep 3, 2026 21:593,98442,623,76431,654,0001,020,0002,121,728stderr
3Sep 3, 2026 21:593,99042,720,57731,676,0001,044,0002,121,728stderr
4Sep 3, 2026 21:594,00942,814,25431,834,0001,046,0002,121,728stderr
5Sep 3, 2026 21:594,02243,640,75131,969,0001,019,0002,121,728stderr
6Sep 3, 2026 21:5916,133142,280,205131,262,0001,030,0002,121,728stderr
7Sep 3, 2026 21:5916,193142,903,446131,775,0001,015,0002,121,728stderr
8Sep 3, 2026 21:5916,206142,826,237131,862,0001,035,0002,121,728stderr
9Sep 3, 2026 21:5916,217143,020,934131,966,0001,017,0002,121,728stderr