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 listSep 8, 2026 05:41Victor MerckléVictor MerckléScore: 3,871Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 05:432,59429,722,28921,277,000024,576stderr
2Sep 8, 2026 05:432,60029,581,93221,320,000024,576stderr
3Sep 8, 2026 05:432,96532,691,42620,575,0003,740,00024,576stderr
4Sep 8, 2026 05:433,11234,475,47120,984,0004,542,00024,576stderr
5Sep 8, 2026 05:433,87140,058,64220,893,00010,851,00024,576stderr
6Sep 8, 2026 05:435,30351,840,87842,470,0001,017,00024,576stderr
7Sep 8, 2026 05:435,80256,809,04342,658,0004,923,00024,576stderr
8Sep 8, 2026 05:436,54262,099,73442,803,00010,848,00024,576stderr
9Sep 8, 2026 05:4318,049723,917,95421,039,000126,966,00024,576stderr