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 11:14Victor MerckléVictor MerckléScore: 2,937Success
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 11:152,84731,381,14122,234,0001,114,0002,117,632stderr
2Jul 7, 2026 11:152,88932,030,28522,667,0001,025,0002,117,632stderr
3Jul 7, 2026 11:152,89932,195,00422,763,0001,013,0002,117,632stderr
4Jul 7, 2026 11:152,92133,707,26522,927,0001,030,0002,117,632stderr
5Jul 7, 2026 11:152,93732,028,67923,053,0001,037,0002,117,632stderr
6Jul 7, 2026 11:1511,656103,610,19394,455,0001,128,0002,117,632stderr
7Jul 7, 2026 11:1511,706104,115,81594,870,0001,127,0002,117,632stderr
8Jul 7, 2026 11:1511,714105,498,50694,924,0001,135,0002,117,632stderr
9Jul 7, 2026 11:1512,201108,470,68598,931,0001,123,0002,117,632stderr