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 13:44Dominique GarmierDominique GarmierScore: 41,498Success
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 13:4440,882364,665,796333,233,0002,001,0002,289,664
2Mar 22, 2026 13:4441,498368,924,511338,280,0002,001,0002,281,472
3Mar 22, 2026 13:4441,530368,486,073338,553,0001,997,0002,293,760