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 00:10Josu San MartinJosu San MartinScore: 15,264Success
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 00:113,01534,664,11323,696,0001,028,0002,121,728stderr
2Sep 4, 2026 00:113,04534,898,10623,933,0001,038,0002,121,728stderr
3Sep 4, 2026 00:113,06735,880,43424,122,0001,030,0002,121,728stderr
4Sep 4, 2026 00:113,09835,301,72824,270,0001,136,0002,121,728stderr
5Sep 4, 2026 00:1115,264135,088,319124,166,0001,006,0002,121,728stderr
6Sep 4, 2026 00:1115,265135,132,436124,167,0001,006,0002,121,728stderr
7Sep 4, 2026 00:1115,285135,268,440124,318,0001,021,0002,121,728stderr
8Sep 4, 2026 00:1115,286135,353,690124,345,0001,005,0002,121,728stderr
9Sep 4, 2026 00:1115,336135,801,605124,747,0001,012,0002,121,728stderr