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 22, 2026 21:12Dominique GarmierDominique GarmierScore: 18,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 21:1218,518181,323,553136,861,00014,984,0002,330,624
2Mar 22, 2026 21:1218,636176,637,876140,832,00011,985,0002,347,008
3Mar 22, 2026 21:1218,793187,257,404144,099,00010,006,0002,383,872