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 listMar 25, 2026 15:15Dominique GarmierDominique GarmierScore: 17,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 14:1017,712167,113,675144,236,0001,001,0002,469,888
2Mar 25, 2026 14:1017,762169,655,967143,656,0001,995,0002,408,448
3Mar 25, 2026 15:2817,775165,521,338142,760,0002,994,0002,326,528
4Mar 25, 2026 15:2817,787166,008,890141,861,0003,996,0002,371,584
5Mar 25, 2026 15:2817,865170,644,782144,487,0002,006,0002,314,240
6Mar 25, 2026 15:1517,898169,865,753143,768,0002,995,0002,527,232
7Mar 25, 2026 15:1517,907170,011,166142,846,0003,995,0002,424,832
8Mar 25, 2026 14:1018,058168,169,190145,074,0003,001,0002,289,664
9Mar 25, 2026 15:1519,612183,905,880158,824,0001,997,0002,502,656