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 7, 2026 12:15Victor MerckléVictor MerckléScore: 3,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:162,90231,902,65622,674,0001,128,0002,117,632stderr
2Jul 7, 2026 12:162,91631,913,77922,874,0001,039,0002,117,632stderr
3Jul 7, 2026 12:162,93432,056,83022,955,0001,107,0002,117,632stderr
4Jul 7, 2026 12:162,96132,283,66623,236,0001,050,0002,117,632stderr
5Jul 7, 2026 12:163,06533,312,97924,079,0001,058,0002,117,632stderr
6Jul 7, 2026 12:1611,688103,867,74194,616,0001,231,0002,117,632stderr
7Jul 7, 2026 12:1611,764104,457,24495,446,0001,022,0002,117,632stderr
8Jul 7, 2026 12:1611,774104,653,04295,430,0001,119,0002,117,632stderr
9Jul 7, 2026 12:1611,902105,693,69896,436,0001,164,0002,117,632stderr