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 3, 2026 11:43Victor MerckléVictor MerckléScore: 3,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 11:442,97232,361,04623,358,0001,016,0002,117,632stderr
2Jul 3, 2026 11:442,97932,706,61123,395,0001,038,0002,117,632stderr
3Jul 3, 2026 11:443,02432,732,68923,784,0001,015,0002,117,632stderr
4Jul 3, 2026 11:443,03934,598,19323,887,0001,034,0002,117,632stderr
5Jul 3, 2026 11:443,04532,924,59123,892,0001,079,0002,117,632stderr
6Jul 3, 2026 11:4411,948105,925,25696,830,0001,150,0002,117,632stderr
7Jul 3, 2026 11:4412,484110,288,844101,238,0001,131,0002,117,632stderr
8Jul 3, 2026 11:4412,502110,761,230101,365,0001,152,0002,117,632stderr
9Jul 3, 2026 11:4412,531110,686,170101,603,0001,155,0002,117,632stderr