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 listJul 7, 2026 12:02Victor MerckléVictor MerckléScore: 5,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 12:025,37352,079,32043,044,0001,019,0002,117,632stderr
2Jul 7, 2026 12:025,37652,018,81142,967,0001,117,0002,117,632stderr
3Jul 7, 2026 12:025,41652,381,67043,252,0001,164,0002,117,632stderr
4Jul 7, 2026 12:025,42352,435,01443,428,0001,047,0002,117,632stderr
5Jul 7, 2026 12:025,66854,507,01645,406,0001,077,0002,117,632stderr
6Jul 7, 2026 12:0214,138124,012,485114,695,0001,243,0002,117,632stderr
7Jul 7, 2026 12:0214,156124,039,137115,003,0001,078,0002,117,632stderr
8Jul 7, 2026 12:0214,176124,206,827115,065,0001,184,0002,117,632stderr
9Jul 7, 2026 12:0214,230124,620,916115,495,0001,192,0002,117,632stderr