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 22, 2026 10:18Dominique GarmierDominique GarmierScore: 66,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 10:1866,055562,719,957539,652,0001,998,0002,519,040
2Mar 22, 2026 19:3366,065567,290,218538,737,0002,998,0002,383,872
3Mar 22, 2026 19:3366,096560,282,025539,988,0001,999,0002,461,696
4Mar 22, 2026 10:1866,108565,132,357540,085,0002,000,0002,531,328
5Mar 22, 2026 10:1866,133564,605,251540,291,0001,997,0002,330,624
6Mar 22, 2026 19:3366,417566,084,275542,618,0001,998,0002,396,160