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 listMay 11, 2026 18:18Pavel SkripkinPavel SkripkinScore: 24,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:204,09240,789,84730,135,0003,424,0002,117,632
2May 11, 2026 18:204,11241,150,14930,592,0003,127,0002,117,632
3May 11, 2026 18:204,11943,452,37330,349,0003,432,0002,117,632
4May 11, 2026 18:204,14741,529,51630,495,0003,517,0002,117,632
5May 11, 2026 18:2024,985214,484,726201,600,0003,278,0002,117,632
6May 11, 2026 18:2024,987212,238,953201,812,0003,082,0002,117,632
7May 11, 2026 18:2025,148213,581,703202,877,0003,344,0002,117,632
8May 11, 2026 18:2025,180213,981,245203,321,0003,156,0002,117,632
9May 11, 2026 18:2025,776219,600,746208,279,0003,090,0002,117,632