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 26, 2026 14:44Dominique GarmierDominique GarmierScore: 10,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 14:4410,680114,906,14187,580,00002,490,368
2Mar 26, 2026 14:4410,860123,601,87887,053,0002,001,0002,433,024
3Mar 26, 2026 14:4410,941114,627,41186,730,0002,990,0002,506,752