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 listJul 2, 2026 14:06Victor MerckléVictor MerckléScore: 3,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:063,01732,644,29223,597,0001,150,0002,117,632stderr
2Jul 2, 2026 14:063,05232,807,28123,877,0001,152,0002,117,632stderr
3Jul 2, 2026 14:063,05332,967,00323,828,0001,214,0002,117,632stderr
4Jul 2, 2026 14:063,06332,999,95623,907,0001,217,0002,117,632stderr
5Jul 2, 2026 14:063,07133,335,17323,981,0001,206,0002,117,632stderr
6Jul 2, 2026 14:063,09834,210,49624,233,0001,178,0002,117,632stderr
7Jul 2, 2026 14:063,12633,571,81924,397,0001,240,0002,117,632stderr
8Jul 2, 2026 14:063,14333,698,20924,568,0001,207,0002,117,632stderr
9Jul 2, 2026 14:0613,147117,028,591105,712,0002,094,0002,117,632stderr