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 17:55Victor MerckléVictor MerckléScore: 2,628Success
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 17:562,54729,242,63120,892,000024,576stderr
2Sep 8, 2026 17:562,55129,159,33920,923,000024,576stderr
3Sep 8, 2026 17:562,55829,418,04920,983,000024,576stderr
4Sep 8, 2026 17:562,57629,363,98521,128,000024,576stderr
5Sep 8, 2026 17:562,62829,839,16821,557,000024,576stderr
6Sep 8, 2026 17:562,63830,078,15621,632,000024,576stderr
7Sep 8, 2026 17:562,64130,496,07021,658,000024,576stderr
8Sep 8, 2026 17:562,64529,907,10821,691,000024,576stderr
9Sep 8, 2026 17:5611,09599,193,50289,971,0001,016,00024,576stderr