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 listApr 30, 2026 07:08olliecrowolliecrowScore: 23,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2026 07:093,30047,251,44624,057,0003,007,0002,510,848
2Apr 30, 2026 07:093,31042,185,34525,138,0002,011,0002,338,816
3Apr 30, 2026 07:0923,703213,112,847191,361,0003,005,0002,322,432
4Apr 30, 2026 07:0923,758220,354,004190,823,0003,996,0002,535,424
5Apr 30, 2026 07:0923,758219,324,415190,824,0003,996,0002,318,336
6Apr 30, 2026 07:0923,763214,381,090192,862,0001,998,0002,555,904
7Apr 30, 2026 07:0923,769212,376,022191,911,0002,998,0002,560,000
8Apr 30, 2026 07:0923,774212,614,980190,950,0003,998,0002,519,040
9Apr 30, 2026 07:0923,774214,154,820191,949,0002,999,0002,322,432