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: 112,353Success
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:41100,961838,783,734686,382,000141,503,0002,113,536
2Nov 4, 2026 19:41107,439892,322,781739,908,000141,099,0002,113,536
3Nov 4, 2026 19:41109,654910,520,339757,991,000141,179,0002,113,536
4Nov 4, 2026 19:41110,938920,539,934768,289,000141,410,0002,113,536
5Nov 4, 2026 19:41112,353932,258,628780,312,000140,990,0002,113,536
6Nov 4, 2026 19:41118,447982,358,503829,441,000141,827,0002,113,536
7Nov 4, 2026 19:41124,0101,027,780,707875,203,000141,679,0002,113,536
8Nov 4, 2026 19:41128,2861,063,079,565907,767,000144,181,0002,113,536
9Nov 4, 2026 19:41130,7321,083,030,280928,687,000143,320,0002,113,536