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 21:38e1011e1011Score: 17,071Success
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 21:3916,944149,753,506137,932,0001,009,0002,113,536
2Nov 4, 2026 21:3917,028150,984,666138,618,0001,014,0002,113,536
3Nov 4, 2026 21:3917,037151,145,231137,687,0002,021,0002,113,536
4Nov 4, 2026 21:3917,038151,142,888138,706,0001,008,0002,113,536
5Nov 4, 2026 21:3917,071151,430,851138,968,0001,015,0002,113,536
6Nov 4, 2026 21:3917,077151,410,698139,021,0001,013,0002,113,536
7Nov 4, 2026 21:3917,101151,529,174138,207,0002,028,0002,113,536
8Nov 4, 2026 21:3917,102151,555,584138,113,0002,126,0002,113,536
9Nov 4, 2026 21:3917,112151,737,315138,316,0002,008,0002,113,536