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 24, 2026 10:26Dominique GarmierDominique GarmierScore: 10,063Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 10:2610,010105,038,86880,078,0002,001,0002,535,424
2Mar 24, 2026 10:2610,063110,369,05480,507,0002,012,0002,351,104
3Mar 24, 2026 10:2610,110103,517,50580,902,0001,997,0002,347,008