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 listSep 1, 2026 13:19Victor MerckléVictor MerckléScore: 2,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 13:202,63529,927,38420,523,0001,087,0002,117,632stderr
2Sep 1, 2026 13:202,64230,056,12020,635,0001,034,0002,117,632stderr
3Sep 1, 2026 13:202,64230,711,54120,630,0001,036,0002,117,632stderr
4Sep 1, 2026 13:202,64330,024,46820,652,0001,027,0002,117,632stderr
5Sep 1, 2026 13:202,64530,794,12720,648,0001,048,0002,117,632stderr
6Sep 1, 2026 13:202,64930,597,51720,688,0001,035,0002,117,632stderr
7Sep 1, 2026 13:205,28251,692,43342,055,0001,261,0002,117,632stderr
8Sep 1, 2026 13:205,29751,884,21342,429,0001,013,0002,117,632stderr
9Sep 1, 2026 13:205,33552,102,80442,492,0001,257,0002,117,632stderr