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 25, 2026 10:16Dominique GarmierDominique GarmierScore: 12,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 10:1612,255125,362,23497,477,0003,014,0002,461,696
2Mar 25, 2026 10:1612,455124,878,89199,128,0003,003,0002,285,568
3Mar 25, 2026 10:1612,466124,826,79999,212,0003,006,0002,273,280