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 listAug 14, 2026 19:07marko1597marko1597Score: 3,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 19:423,79639,325,24228,995,0002,137,0002,121,728stderr
2Aug 14, 2026 19:423,82139,600,91829,198,0002,139,0002,121,728stderr
3Aug 14, 2026 19:423,82939,664,88829,275,0002,123,0002,121,728stderr
4Aug 14, 2026 19:423,82939,910,48829,218,0002,187,0002,121,728stderr
5Aug 14, 2026 19:423,83639,680,03029,242,0002,219,0002,121,728stderr
6Aug 14, 2026 19:423,84039,718,54729,349,0002,146,0002,121,728stderr
7Aug 14, 2026 19:423,85039,977,84029,444,0002,133,0002,121,728stderr
8Aug 14, 2026 19:423,86540,175,93529,474,0002,226,0002,121,728stderr
9Aug 14, 2026 19:423,91440,297,64629,884,0002,213,0002,121,728stderr