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 listJun 26, 2026 06:59Zhou180Zhou180Score: 3,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 07:003,85140,856,21529,423,0002,156,0002,117,632
2Jun 26, 2026 07:003,87440,916,77329,460,0002,309,0002,117,632
3Jun 26, 2026 07:003,87941,012,18829,544,0002,264,0002,117,632
4Jun 26, 2026 07:003,91641,257,31929,828,0002,290,0002,117,632
5Jun 26, 2026 07:003,91641,901,45929,859,0002,253,0002,117,632
6Jun 26, 2026 07:003,94741,571,78330,082,0002,291,0002,117,632
7Jun 26, 2026 07:003,97641,742,96530,336,0002,268,0002,117,632
8Jun 26, 2026 07:0021,661186,835,361174,327,0003,300,0002,117,632
9Jun 26, 2026 07:0022,251191,575,444179,186,0003,275,0002,117,632