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 07:47Victor MerckléVictor MerckléScore: 3,304Success
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 07:483,18734,641,88224,981,0001,155,0002,117,632stderr
2Jul 7, 2026 07:483,23934,643,82225,408,0001,153,0002,117,632stderr
3Jul 7, 2026 07:483,24135,137,95425,373,0001,211,0002,117,632stderr
4Jul 7, 2026 07:483,24334,499,54425,415,0001,178,0002,117,632stderr
5Jul 7, 2026 07:483,30436,973,46426,004,0001,090,0002,117,632stderr
6Jul 7, 2026 07:4811,996107,029,36997,364,0001,009,0002,117,632stderr
7Jul 7, 2026 07:4812,050106,880,80297,803,0001,008,0002,117,632stderr
8Jul 7, 2026 07:4812,093107,262,19698,159,0001,007,0002,117,632stderr
9Jul 7, 2026 07:4812,126108,038,86998,434,0001,007,0002,117,632stderr