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 14:58Dominique GarmierDominique GarmierScore: 12,284Success
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 14:5812,136127,802,95898,509,0001,005,0002,506,752
2Mar 24, 2026 14:5812,284129,291,14398,734,0001,994,0002,494,464
3Mar 24, 2026 14:5812,371127,583,392101,439,00002,330,624