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 listJul 1, 2026 05:02Victor MerckléVictor MerckléScore: 3,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 05:023,10433,605,45724,411,0001,044,0002,117,632stderr
2Jul 1, 2026 05:023,13433,604,99624,649,0001,057,0002,117,632stderr
3Jul 1, 2026 05:023,14833,660,10124,775,0001,043,0002,117,632stderr
4Jul 1, 2026 05:023,15333,757,54424,802,0001,060,0002,117,632stderr
5Jul 1, 2026 05:023,15933,803,38724,847,0001,064,0002,117,632stderr
6Jul 1, 2026 05:023,15933,779,94024,850,0001,059,0002,117,632stderr
7Jul 1, 2026 05:023,21034,240,98725,277,0001,049,0002,117,632stderr
8Jul 1, 2026 05:0212,733112,506,829102,286,0002,125,0002,117,632stderr
9Jul 1, 2026 05:0212,734112,270,684102,311,0002,111,0002,117,632stderr