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 04:49Dominique GarmierDominique GarmierScore: 14,255Success
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 04:4914,201148,615,093115,445,0001,003,0002,490,368
2Mar 25, 2026 04:4914,255143,739,117114,889,0001,998,0002,334,720
3Mar 25, 2026 04:4914,282144,248,724115,112,0002,001,0002,392,064