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 listMay 21, 2026 23:51M-RochatM-RochatScore: 19,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 23:547,25069,499,81256,260,0003,194,0002,113,536
2May 21, 2026 23:547,34372,637,17356,827,0003,387,0002,113,536
3May 21, 2026 23:547,43970,323,30157,711,0003,293,0002,113,536
4May 21, 2026 23:547,44171,234,87857,668,0003,350,0002,113,536
5May 21, 2026 23:5419,228168,559,272153,280,0004,391,0002,117,632
6May 21, 2026 23:5419,338170,504,976154,235,0004,341,0002,113,536
7May 21, 2026 23:5419,370168,205,300154,508,0004,333,0002,117,632
8May 21, 2026 23:5419,391171,014,368154,628,0004,379,0002,117,632
9May 21, 2026 23:5419,468169,029,736155,187,0004,457,0002,117,632