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 18, 2026 16:15M-RochatM-RochatScore: 24,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 16:1711,658107,100,30985,891,0009,711,0002,113,536
2May 18, 2026 16:1723,955205,843,146184,973,00011,463,0002,117,632
3May 18, 2026 16:1723,961208,547,958185,906,00010,578,0002,117,632
4May 18, 2026 16:1723,969206,688,097185,649,00010,897,0002,117,632
5May 18, 2026 16:1724,018206,315,944185,855,00011,099,0002,117,632
6May 18, 2026 16:1724,218209,633,270187,437,00011,151,0002,117,632
7May 18, 2026 16:1724,218209,686,446187,645,00010,945,0002,117,632
8May 18, 2026 16:1724,234208,457,151187,654,00011,070,0002,117,632
9May 18, 2026 16:1724,290208,921,516187,973,00011,208,0002,117,632