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 16, 2026 22:46M-RochatM-RochatScore: 13,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 22:5213,274117,596,084103,182,0005,667,0002,113,536
2May 16, 2026 22:5213,304117,893,494103,292,0005,804,0002,113,536
3May 16, 2026 22:5213,324118,115,696103,533,0005,728,0002,113,536
4May 16, 2026 22:5213,350118,257,352103,909,0005,561,0002,113,536
5May 16, 2026 22:5213,416119,001,097104,424,0005,595,0002,113,536
6May 16, 2026 22:5213,495119,647,443104,977,0005,685,0002,113,536
7May 16, 2026 22:5218,024156,628,479142,033,0005,768,0002,117,632
8May 16, 2026 22:5218,089157,183,999141,895,0006,439,0002,117,632
9May 16, 2026 22:5218,250158,413,887143,870,0005,784,0002,117,632