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 listNov 4, 2026 18:40e1011e1011Score: 109,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 18:4183,620697,125,726548,907,000136,777,0002,113,536
2Nov 4, 2026 18:4194,714787,748,254634,388,000142,273,0002,113,536
3Nov 4, 2026 18:4195,631795,256,740644,944,000139,236,0002,113,536
4Nov 4, 2026 18:41102,725853,331,550700,540,000141,805,0002,113,536
5Nov 4, 2026 18:41109,350908,015,744756,068,000140,602,0002,113,536
6Nov 4, 2026 18:41127,6531,057,746,978907,934,000138,823,0002,113,536
7Nov 4, 2026 18:41148,5011,228,944,2691,076,843,000140,873,0002,113,536
8Nov 4, 2026 18:41156,5921,294,999,0771,142,172,000141,888,0002,113,536
9Nov 4, 2026 18:41164,6431,360,974,8241,209,638,000140,435,0002,113,536