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 19:38e1011e1011Score: 75,978Success
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 19:4263,571532,650,688380,383,000140,906,0002,113,536
2Nov 4, 2026 19:4268,142570,268,238415,861,000142,905,0002,113,536
3Nov 4, 2026 19:4271,562597,792,710444,376,000142,437,0002,113,536
4Nov 4, 2026 19:4273,579614,519,162462,383,000140,968,0002,113,536
5Nov 4, 2026 19:4275,978634,394,967479,780,000143,242,0002,113,536
6Nov 4, 2026 19:4276,036634,561,656482,960,000140,537,0002,113,536
7Nov 4, 2026 19:4276,696639,706,448487,154,000141,760,0002,113,536
8Nov 4, 2026 19:4277,109643,732,011491,874,000140,422,0002,113,536
9Nov 4, 2026 19:4278,685658,190,282502,051,000143,167,0002,113,536