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 17, 2026 04:05M-RochatM-RochatScore: 11,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 04:0610,67096,754,27280,089,0007,406,0002,113,536
2May 17, 2026 04:0610,84497,684,85881,505,0007,422,0002,113,536
3May 17, 2026 04:0610,97298,702,71882,803,0007,168,0002,113,536
4May 17, 2026 04:0611,01699,119,78882,952,0007,385,0002,113,536
5May 17, 2026 04:0611,072101,521,77683,178,0007,617,0002,113,536
6May 17, 2026 04:0622,710195,039,143177,743,0008,483,0002,117,632
7May 17, 2026 04:0622,827196,664,399178,611,0008,576,0002,117,632
8May 17, 2026 04:0622,976197,223,009180,083,0008,321,0002,117,632
9May 17, 2026 04:0623,104199,899,286180,989,0008,464,0002,117,632