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:07Victor MerckléVictor MerckléScore: 3,063Success
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:083,02832,750,37023,736,0001,101,0002,117,632stderr
2Jul 1, 2026 05:083,03732,796,60223,731,0001,178,0002,117,632stderr
3Jul 1, 2026 05:083,04533,036,99823,804,0001,168,0002,117,632stderr
4Jul 1, 2026 05:083,05432,916,55823,889,0001,159,0002,117,632stderr
5Jul 1, 2026 05:083,06333,027,11124,057,0001,061,0002,117,632stderr
6Jul 1, 2026 05:083,11133,610,37624,322,0001,194,0002,117,632stderr
7Jul 1, 2026 05:0812,063106,924,36097,912,0001,010,0002,117,632stderr
8Jul 1, 2026 05:0812,614111,254,911102,434,0001,007,0002,117,632stderr
9Jul 1, 2026 05:0812,633111,500,827102,590,0001,008,0002,117,632stderr