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 12, 2026 22:10Josu San MartinJosu San MartinScore: 11,220Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 22:1011,205119,581,37989,880,0001,997,0002,437,120
2Mar 12, 2026 22:1011,220115,740,84890,006,0002,000,0002,367,488
3Mar 12, 2026 22:1011,259116,279,65591,323,0001,003,0002,367,488