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 27, 2026 17:08Dominique GarmierDominique GarmierScore: 12,653Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 17:0812,595131,693,416102,275,0001,002,0002,289,664
2Mar 27, 2026 17:0812,653131,246,551101,760,0001,995,0002,510,848
3Mar 27, 2026 17:0812,654130,737,023101,768,0001,995,0002,351,104