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 08:37Zhou180Zhou180Score: 22,081Success
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 08:3721,605186,304,058175,157,0002,012,0002,117,632
2Jun 26, 2026 08:3721,767187,683,101175,472,0003,025,0002,117,632
3Jun 26, 2026 08:3721,975189,305,987178,187,0002,014,0002,117,632
4Jun 26, 2026 08:3722,023189,699,515178,581,0002,012,0002,117,632
5Jun 26, 2026 08:3722,081190,246,570178,009,0003,060,0002,117,632
6Jun 26, 2026 08:3722,094190,356,072179,163,0002,011,0002,117,632
7Jun 26, 2026 08:3722,405193,292,251180,712,0003,012,0002,117,632
8Jun 26, 2026 08:3722,504193,669,245182,522,0002,013,0002,117,632
9Jun 26, 2026 08:3722,641194,863,520183,649,0002,012,0002,117,632