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 04:31e1011e1011Score: 109,302Success
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 04:3282,482687,313,525534,285,000142,069,0002,113,536
2Nov 4, 2026 04:3285,852715,021,954562,910,000141,084,0002,113,536
3Nov 4, 2026 04:3295,562794,657,091642,831,000140,779,0002,113,536
4Nov 4, 2026 04:3296,895805,517,220653,902,000140,637,0002,113,536
5Nov 4, 2026 04:32109,302907,263,787755,476,000140,805,0002,113,536
6Nov 4, 2026 04:32123,9331,027,309,657875,294,000140,961,0002,113,536
7Nov 4, 2026 04:32152,8671,264,555,5841,113,135,000140,377,0002,113,536
8Nov 4, 2026 04:32162,3721,342,836,3951,190,022,000141,432,0002,113,536
9Nov 4, 2026 04:32163,7631,354,504,7981,202,675,000140,182,0002,113,536