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 29, 2026 14:05Victor MerckléVictor MerckléScore: 2,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 14:092,71730,627,84921,203,0001,077,0002,117,632stderr
2Aug 29, 2026 14:092,71930,614,71921,222,0001,077,0002,117,632stderr
3Aug 29, 2026 14:092,74330,866,63421,365,0001,130,0002,117,632stderr
4Aug 29, 2026 14:092,74330,668,16421,485,0001,013,0002,117,632stderr
5Aug 29, 2026 14:092,74330,796,94721,483,0001,017,0002,117,632stderr
6Aug 29, 2026 14:095,37452,461,04343,044,0001,024,0002,117,632stderr
7Aug 29, 2026 14:095,37452,389,18542,942,0001,126,0002,117,632stderr
8Aug 29, 2026 14:095,40752,767,75643,216,0001,128,0002,117,632stderr
9Aug 29, 2026 14:095,42152,606,01243,304,0001,156,0002,117,632stderr