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: 25,133Success
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,16044,454,84930,565,0003,553,0002,117,632
2May 11, 2026 18:204,16844,529,13230,730,0003,453,0002,117,632
3May 11, 2026 18:2024,549209,574,436197,810,0003,495,0002,117,632
4May 11, 2026 18:2025,022215,524,575202,153,0003,034,0002,117,632
5May 11, 2026 18:2025,133213,388,058202,571,0003,527,0002,117,632
6May 11, 2026 18:2025,285216,409,607203,905,0003,437,0002,117,632
7May 11, 2026 18:2025,364217,927,410204,640,0003,352,0002,117,632
8May 11, 2026 18:2025,453216,078,974205,126,0003,592,0002,117,632
9May 11, 2026 18:2025,555216,923,261206,046,0003,513,0002,117,632