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 listMay 1, 2026 10:41Victor MerckléVictor MerckléScore: 66,372Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 10:4366,172562,591,230538,619,0003,997,0002,322,432stderr
2May 1, 2026 10:4366,175563,758,391539,640,0002,998,0002,342,912stderr
3May 1, 2026 10:4366,295571,609,322539,622,0003,997,0002,465,792stderr
4May 1, 2026 10:4366,310565,514,376540,749,0002,998,0002,506,752stderr
5May 1, 2026 10:4366,372559,727,666542,253,0002,000,0002,547,712stderr
6May 1, 2026 10:4366,387562,298,432541,379,0002,996,0002,437,120stderr
7May 1, 2026 10:4366,428560,531,637541,719,0002,998,0002,486,272stderr
8May 1, 2026 10:4366,574568,593,979543,909,0001,999,0002,527,232stderr
9May 1, 2026 10:4366,600563,639,310542,123,0004,000,0002,531,328stderr