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 listMar 28, 2026 18:34Dominique GarmierDominique GarmierScore: 14,865Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 18:3414,747151,871,911118,928,0001,998,0002,531,328
2Mar 28, 2026 18:0814,850148,014,611116,780,0004,990,0002,347,008
3Mar 28, 2026 18:0814,856146,194,412119,821,0001,997,0002,527,232
4Mar 28, 2026 18:3414,865148,054,755120,891,000999,0002,347,008
5Mar 28, 2026 18:0814,916145,348,321119,304,0003,007,0002,498,560
6Mar 28, 2026 18:3414,945152,155,175120,541,0002,009,0002,404,352