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 23, 2026 10:34Dominique GarmierDominique GarmierScore: 16,385Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 09:4216,116162,086,995131,154,0001,001,0002,412,544
2Mar 23, 2026 09:4216,137158,035,949131,318,0001,002,0002,506,752
3Mar 23, 2026 10:3416,337156,178,194132,961,000999,0002,359,296
4Mar 23, 2026 09:4216,385157,299,400133,356,0001,002,0002,457,600
5Mar 23, 2026 10:3416,397159,761,619133,452,0001,003,0002,449,408
6Mar 23, 2026 10:3416,446160,198,101132,861,0001,997,0002,445,312