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 30, 2026 08:36Dominique GarmierDominique GarmierScore: 10,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 08:3610,418107,108,46584,422,0001,005,0002,416,640
2Mar 30, 2026 08:3610,460111,991,10579,785,0005,983,0002,527,232
3Mar 30, 2026 08:3610,472117,285,59583,876,0001,997,0002,461,696