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 listAug 14, 2026 17:55marko1597marko1597Score: 86,255Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:5683,747696,670,265681,553,0005,176,0002,117,632stderr
2Aug 14, 2026 17:5685,222708,934,748692,475,0006,349,0002,117,632stderr
3Aug 14, 2026 17:5685,729712,983,090696,585,0006,397,0002,117,632stderr
4Aug 14, 2026 17:5686,229717,130,162700,599,0006,480,0002,117,632stderr
5Aug 14, 2026 17:5686,255717,250,341700,728,0006,569,0002,117,632stderr
6Aug 14, 2026 17:5686,909722,612,825705,732,0006,922,0002,117,632stderr
7Aug 14, 2026 17:5687,185724,969,937708,277,0006,641,0002,117,632stderr
8Aug 14, 2026 17:5687,637728,616,627710,938,0007,691,0002,117,632stderr
9Aug 14, 2026 17:5687,809732,288,251713,136,0006,899,0002,117,632stderr