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 listAug 19, 2026 14:41Victor MerckléVictor MerckléScore: 5,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 14:422,78531,917,25021,710,0001,131,0002,117,632stderr
2Aug 19, 2026 14:422,80031,349,52821,882,0001,081,0002,117,632stderr
3Aug 19, 2026 14:422,80132,020,88921,855,0001,116,0002,117,632stderr
4Aug 19, 2026 14:422,83731,610,90722,000,0001,264,0002,117,632stderr
5Aug 19, 2026 14:425,50653,497,44044,140,0001,016,0002,117,632stderr
6Aug 19, 2026 14:425,52254,049,91944,267,0001,021,0002,117,632stderr
7Aug 19, 2026 14:425,52554,319,29944,286,0001,023,0002,117,632stderr
8Aug 19, 2026 14:425,52653,466,25544,301,0001,020,0002,117,632stderr
9Aug 19, 2026 14:425,55753,949,66644,552,0001,020,0002,117,632stderr