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 listApr 29, 2026 13:48TudyMTudyMScore: 17,329Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 13:5517,222159,285,094140,227,0001,001,0002,375,680
2Apr 29, 2026 13:5517,247160,538,572140,430,0001,003,0002,310,144
3Apr 29, 2026 13:5517,272159,380,517139,642,0001,994,0002,375,680
4Apr 29, 2026 13:5517,323159,033,257141,052,0001,000,0002,371,584
5Apr 29, 2026 13:5517,329160,683,029141,102,0001,000,0002,371,584
6Apr 29, 2026 13:5517,333158,441,402141,136,0001,000,0002,306,048
7Apr 29, 2026 13:5517,371156,929,101140,442,0002,006,0002,363,392
8Apr 29, 2026 13:5517,430161,613,993140,934,0001,999,0002,371,584
9Apr 29, 2026 13:5517,449157,663,863141,081,0002,001,0002,371,584