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 listApr 29, 2026 06:24olliecrowolliecrowScore: 23,839Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 06:243,30048,363,74525,058,0002,004,0002,531,328
2Apr 29, 2026 06:243,31143,541,45525,142,0002,011,0002,338,816
3Apr 29, 2026 06:2423,743215,556,345190,707,0003,993,0002,342,912
4Apr 29, 2026 06:2423,769218,591,826191,915,0002,998,0002,551,808
5Apr 29, 2026 06:2423,839213,210,250192,474,0003,007,0002,506,752
6Apr 29, 2026 06:2423,849211,025,367192,576,0002,993,0002,408,448
7Apr 29, 2026 06:2423,856212,003,126190,633,0004,990,0002,461,696
8Apr 29, 2026 06:2423,894214,684,784192,935,0002,998,0002,424,832
9Apr 29, 2026 06:2423,901212,881,620193,993,0001,999,0002,396,160