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 10, 2026 20:42olliecrowolliecrowScore: 15,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 20:4210,347109,900,41084,847,00002,277,376
2Mar 10, 2026 20:4215,576153,000,386123,731,0003,991,0002,420,736
3Mar 10, 2026 20:4215,605153,242,475125,961,0001,999,0002,355,200