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 23, 2026 19:14Victor MerckléVictor MerckléScore: 5,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:152,79131,217,00521,813,0001,079,0002,117,632stderr
2Aug 23, 2026 19:152,79832,104,15321,852,0001,094,0002,117,632stderr
3Aug 23, 2026 19:152,82031,396,16122,016,0001,113,0002,117,632stderr
4Aug 23, 2026 19:152,96532,521,02623,218,0001,097,0002,117,632stderr
5Aug 23, 2026 19:155,43354,062,64043,424,0001,129,0002,117,632stderr
6Aug 23, 2026 19:155,44052,931,75843,561,0001,049,0002,117,632stderr
7Aug 23, 2026 19:155,45053,011,33243,546,0001,144,0002,117,632stderr
8Aug 23, 2026 19:155,46053,769,38243,638,0001,141,0002,117,632stderr
9Aug 23, 2026 19:155,47253,443,15043,717,0001,155,0002,117,632stderr