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 listMay 1, 2026 18:13Pavel SkripkinPavel SkripkinScore: 11,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 18:1411,938114,521,22795,898,0001,997,0002,428,928
2May 1, 2026 18:1411,945116,829,62995,952,0001,999,0002,420,736
3May 1, 2026 18:1411,965120,544,43295,115,0003,003,0002,420,736
4May 1, 2026 18:1411,969115,975,64495,142,0003,004,0002,424,832
5May 1, 2026 18:1411,989114,037,60997,314,0001,003,0002,424,832
6May 1, 2026 18:1411,995117,924,84197,359,0001,003,0002,416,640
7May 1, 2026 18:1412,003117,899,33597,425,0001,004,0002,433,024
8May 1, 2026 18:1412,005111,682,47596,432,0002,009,0002,424,832
9May 1, 2026 18:1412,017115,589,15196,532,0002,011,0002,420,736