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 23, 2026 17:01Dominique GarmierDominique GarmierScore: 9,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 17:019,507103,312,80776,955,000999,0002,408,448
2Mar 23, 2026 17:019,512106,280,33375,001,0003,000,0002,330,624
3Mar 23, 2026 17:019,513106,150,76876,004,0002,000,0002,355,200
4Mar 23, 2026 17:019,521105,237,20475,071,0003,002,0002,347,008
5Mar 23, 2026 17:019,542105,828,76575,233,0003,009,0002,297,856
6Mar 23, 2026 17:019,542104,070,88875,237,0003,009,0002,465,792
7Mar 23, 2026 17:019,550105,601,52976,299,0002,007,0002,289,664
8Mar 23, 2026 17:019,552105,012,18877,324,0001,004,0002,519,040
9Mar 23, 2026 17:019,552102,710,87676,322,0002,008,0002,408,448