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 01:01Dominique GarmierDominique GarmierScore: 22,940Success
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 01:0122,864216,275,272184,480,0003,007,0002,310,144
2Mar 25, 2026 01:0122,940211,892,017186,103,0002,001,0002,367,488
3Mar 25, 2026 01:0123,093218,081,089187,361,0002,003,0002,482,176