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 14:52Victor MerckléVictor MerckléScore: 2,811Success
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 14:532,76930,930,44521,614,0001,092,0002,117,632stderr
2Aug 23, 2026 14:532,78731,126,59421,837,0001,019,0002,117,632stderr
3Aug 23, 2026 14:532,78831,086,61321,849,0001,018,0002,117,632stderr
4Aug 23, 2026 14:532,79131,881,43121,873,0001,017,0002,117,632stderr
5Aug 23, 2026 14:532,81132,052,06722,040,0001,015,0002,117,632stderr
6Aug 23, 2026 14:535,42652,713,64343,372,0001,126,0002,117,632stderr
7Aug 23, 2026 14:535,46253,697,42643,652,0001,141,0002,117,632stderr
8Aug 23, 2026 14:535,70868,773,32945,583,0001,228,0002,117,632stderr
9Aug 23, 2026 14:535,77864,721,14246,365,0001,015,0002,117,632stderr