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:22Victor MerckléVictor MerckléScore: 3,023Success
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:232,95932,133,39123,253,0001,013,0002,117,632stderr
2Jul 2, 2026 14:232,96232,184,60923,255,0001,034,0002,117,632stderr
3Jul 2, 2026 14:232,99632,498,66023,552,0001,016,0002,117,632stderr
4Jul 2, 2026 14:233,01732,656,06323,614,0001,127,0002,117,632stderr
5Jul 2, 2026 14:233,02333,021,48123,762,0001,027,0002,117,632stderr
6Jul 2, 2026 14:233,02432,672,40923,688,0001,116,0002,117,632stderr
7Jul 2, 2026 14:233,03032,739,94223,828,0001,019,0002,117,632stderr
8Jul 2, 2026 14:2312,080106,939,43597,923,0001,134,0002,117,632stderr
9Jul 2, 2026 14:2312,246108,298,53399,404,0001,014,0002,117,632stderr