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 27, 2026 22:18TudyMTudyMScore: 17,467Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:2817,400157,855,069139,693,0002,993,0002,367,488
2Apr 27, 2026 22:2817,412157,581,119140,788,0001,996,0002,371,584
3Apr 27, 2026 22:2817,422164,653,816140,863,0001,998,0002,301,952
4Apr 27, 2026 22:2817,435159,557,708140,968,0001,999,0002,367,488
5Apr 27, 2026 22:2817,467159,848,020142,229,0001,001,0002,379,776
6Apr 27, 2026 22:2817,477164,175,238141,310,0002,004,0002,375,680
7Apr 27, 2026 22:2817,482161,654,927142,356,0001,002,0002,371,584
8Apr 27, 2026 22:2817,488163,245,552142,400,0001,002,0002,301,952
9Apr 27, 2026 22:2817,510163,075,619140,595,0002,991,0002,293,760