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 14:19Victor MerckléVictor MerckléScore: 2,624Success
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 14:202,61329,809,68820,358,0001,071,0002,117,632stderr
2Sep 1, 2026 14:202,61529,804,94420,417,0001,032,0002,117,632stderr
3Sep 1, 2026 14:202,62029,825,39220,472,0001,018,0002,117,632stderr
4Sep 1, 2026 14:202,62029,646,27120,475,0001,013,0002,117,632stderr
5Sep 1, 2026 14:202,62430,518,26120,488,0001,032,0002,117,632stderr
6Sep 1, 2026 14:202,62529,829,86620,513,0001,018,0002,117,632stderr
7Sep 1, 2026 14:202,62630,570,67120,518,0001,023,0002,117,632stderr
8Sep 1, 2026 14:205,38952,390,70443,162,0001,028,0002,117,632stderr
9Sep 1, 2026 14:2015,051131,755,606122,414,0001,008,0002,117,632stderr