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 18, 2026 21:35Charles CabergsCharles CabergsScore: 9,942Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2026 21:359,800106,592,22477,349,0003,013,0002,428,928
2Apr 18, 2026 21:359,856108,809,94378,827,0001,995,0002,297,856
3Apr 18, 2026 21:359,857105,740,71178,830,0001,995,0002,449,408
4Apr 18, 2026 21:359,876112,474,46079,987,000999,0002,412,544
5Apr 18, 2026 21:359,942103,668,98177,496,0004,025,0002,433,024
6Apr 18, 2026 21:359,978107,770,44979,824,0001,995,0002,367,488
7Apr 18, 2026 21:359,980112,126,63777,845,0003,992,0002,338,816
8Apr 18, 2026 21:3510,020107,621,42477,154,0005,010,0002,265,088
9Apr 18, 2026 21:3510,036107,381,25380,289,0002,007,0002,355,200