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 15:01A_ShamanA_ShamanScore: 13,645Success
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 15:0213,571120,684,553109,248,0002,036,0002,113,536
2Jul 2, 2026 15:0213,585121,968,598109,350,0002,051,0002,113,536
3Jul 2, 2026 15:0213,592120,758,429109,426,0002,035,0002,113,536
4Jul 2, 2026 15:0213,601120,843,852109,459,0002,076,0002,113,536
5Jul 2, 2026 15:0213,645121,237,286109,884,0002,012,0002,113,536
6Jul 2, 2026 15:0213,653121,343,488109,895,0002,061,0002,113,536
7Jul 2, 2026 15:0213,655121,312,503109,944,0002,030,0002,113,536
8Jul 2, 2026 15:0213,689121,589,625110,168,0002,083,0002,113,536
9Jul 2, 2026 15:0213,797123,211,001110,954,0002,189,0002,113,536