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 2, 2026 14:17Victor MerckléVictor MerckléScore: 9,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:189,24283,837,98774,617,0001,170,0002,117,632stderr
2Jul 2, 2026 14:189,24483,713,59074,653,0001,154,0002,117,632stderr
3Jul 2, 2026 14:189,26883,846,87774,854,0001,145,0002,117,632stderr
4Jul 2, 2026 14:189,27683,919,15074,898,0001,170,0002,117,632stderr
5Jul 2, 2026 14:189,29384,404,92775,014,0001,193,0002,117,632stderr
6Jul 2, 2026 14:189,30084,265,36575,074,0001,186,0002,117,632stderr
7Jul 2, 2026 14:189,32984,433,47875,318,0001,180,0002,117,632stderr
8Jul 2, 2026 14:1818,178156,974,271148,062,0001,004,0002,117,632stderr
9Jul 2, 2026 14:1818,228157,331,454148,467,0001,006,0002,117,632stderr