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 29, 2026 18:11Dominique GarmierDominique GarmierScore: 407,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 17:18148,5851,243,490,3051,215,402,0002,998,0002,363,392
2Mar 29, 2026 17:18148,8581,243,752,4111,217,633,0002,999,0002,297,856
3Mar 29, 2026 17:18149,2111,245,469,5131,221,534,0001,999,0002,482,176
4Mar 29, 2026 18:11407,7243,375,343,8363,342,336,000999,0002,314,240
5Mar 29, 2026 18:11408,4603,381,983,8723,347,371,0001,998,0002,285,568
6Mar 29, 2026 18:11416,0573,439,147,1773,410,672,000999,0002,400,256