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 12:13Dominique GarmierDominique GarmierScore: 10,750Success
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 12:1310,670120,945,58585,487,0002,011,0002,392,064
2Mar 22, 2026 12:1310,750113,094,22584,144,0004,006,0002,318,336
3Mar 22, 2026 12:1310,795113,271,43186,509,0002,011,0002,359,296