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 9, 2026 08:04Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 08:04061,560,63036,147,0007,960,0002,355,200expected "2006973501 ", got " "
2May 9, 2026 08:045,43758,576,98436,593,0007,997,0002,433,024
3May 9, 2026 08:045,45159,485,00236,273,0008,426,0002,486,272
4May 9, 2026 08:045,49157,732,47436,718,0008,313,0002,527,232
5May 9, 2026 08:045,51460,846,00336,895,0008,323,0002,314,240
6May 9, 2026 08:045,51863,411,36936,805,0008,446,0002,351,104
7May 9, 2026 08:045,52360,127,14836,905,0008,389,0002,498,560
8May 9, 2026 08:045,59258,645,81037,189,0008,670,0002,498,560
9May 9, 2026 08:045,78965,586,09138,240,0009,237,0002,383,872