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 01:23Victor MerckléVictor MerckléScore: 12,201Success
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 01:243,05732,996,72723,970,0001,103,0002,117,632stderr
2Jul 2, 2026 01:243,12533,544,42824,447,0001,183,0002,117,632stderr
3Jul 2, 2026 01:243,14533,954,38824,607,0001,187,0002,117,632stderr
4Jul 2, 2026 01:2412,173108,048,48298,813,0001,009,0002,117,632stderr
5Jul 2, 2026 01:2412,201107,914,61999,046,0001,010,0002,117,632stderr
6Jul 2, 2026 01:2412,223108,050,00499,224,0001,008,0002,117,632stderr
7Jul 2, 2026 01:2412,271108,584,29699,619,0001,009,0002,117,632stderr
8Jul 2, 2026 01:2412,286108,640,20999,744,0001,008,0002,117,632stderr
9Jul 2, 2026 01:2412,319108,894,381100,010,0001,007,0002,117,632stderr