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:02M-RochatM-RochatScore: 21,959Success
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:049,81589,273,77274,969,0005,521,0002,113,536
2May 17, 2026 04:049,88989,824,98475,474,0005,623,0002,113,536
3May 17, 2026 04:0410,06391,324,22277,109,0005,415,0002,113,536
4May 17, 2026 04:0410,07291,399,33977,135,0005,461,0002,113,536
5May 17, 2026 04:0421,959188,890,516173,534,0006,531,0002,113,536
6May 17, 2026 04:0422,021190,018,374174,136,0006,442,0002,117,632
7May 17, 2026 04:0422,044191,267,929174,069,0006,694,0002,117,632
8May 17, 2026 04:0422,057191,312,996174,402,0006,471,0002,117,632
9May 17, 2026 04:0422,506193,321,572177,920,0006,633,0002,117,632