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:28Zhou180Zhou180Score: 22,145Success
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 06:293,89141,941,12029,617,0002,291,0002,117,632
2Jun 26, 2026 06:293,92641,369,81329,970,0002,225,0002,117,632
3Jun 26, 2026 06:2921,684186,989,187174,759,0003,053,0002,117,632
4Jun 26, 2026 06:2921,752187,533,689175,252,0003,115,0002,117,632
5Jun 26, 2026 06:2922,145190,889,735178,428,0003,164,0002,117,632
6Jun 26, 2026 06:2922,173190,890,783178,703,0003,118,0002,117,632
7Jun 26, 2026 06:2922,287191,828,976179,549,0003,211,0002,117,632
8Jun 26, 2026 06:2922,353192,578,232180,043,0003,259,0002,117,632
9Jun 26, 2026 06:2922,487193,542,462181,325,0003,073,0002,117,632