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 2, 2026 14:30A_ShamanA_ShamanScore: 14,090Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 14:3013,950123,719,717112,342,0002,051,0002,113,536
2Jul 2, 2026 14:3013,964123,857,250112,484,0002,022,0002,113,536
3Jul 2, 2026 14:3013,967123,895,799112,477,0002,058,0002,113,536
4Jul 2, 2026 14:3014,013124,437,616112,886,0002,027,0002,113,536
5Jul 2, 2026 14:3014,090124,975,877113,314,0002,226,0002,113,536
6Jul 2, 2026 14:3014,099124,984,074113,503,0002,112,0002,113,536
7Jul 2, 2026 14:3014,137125,309,670113,780,0002,149,0002,113,536
8Jul 2, 2026 14:3014,146125,306,536113,846,0002,157,0002,113,536
9Jul 2, 2026 14:3014,417127,606,283116,182,0002,045,0002,113,536