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 8, 2026 11:48janwwwjanwwwScore: 3,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 11:493,82040,535,37930,312,0001,014,00024,576stderr
2Nov 8, 2026 11:493,84440,752,52430,518,0001,010,00024,576stderr
3Nov 8, 2026 11:493,84840,781,07130,549,0001,012,00024,576stderr
4Nov 8, 2026 11:493,87040,937,71730,726,0001,010,00024,576stderr
5Nov 8, 2026 11:493,88541,077,07730,853,0001,010,00024,576stderr
6Nov 8, 2026 11:493,90141,208,97130,978,0001,012,00024,576stderr
7Nov 8, 2026 11:493,92541,390,14331,176,0001,010,00024,576stderr
8Nov 8, 2026 11:493,95341,661,55431,408,0001,011,00024,576stderr
9Nov 8, 2026 11:4934,755294,239,704283,988,0001,003,00024,576stderr