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 21, 2026 13:41Dominique GarmierDominique GarmierScore: 13,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 13:4113,479140,112,636109,525,0001,004,0002,420,736
2Mar 21, 2026 13:4113,489136,215,427108,599,0002,011,0002,318,336
3Mar 21, 2026 13:4113,490136,222,181109,615,0001,005,0002,363,392