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 listMay 16, 2026 19:48M-RochatM-RochatScore: 18,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 19:4918,093157,231,205147,138,0001,230,0002,113,536
2May 16, 2026 19:4918,114158,986,069147,306,0001,230,0002,113,536
3May 16, 2026 19:4918,128157,461,708147,409,0001,244,0002,113,536
4May 16, 2026 19:4918,138157,542,519147,469,0001,263,0002,113,536
5May 16, 2026 19:4918,157159,519,457147,648,0001,246,0002,113,536
6May 16, 2026 19:4918,160157,793,850147,645,0001,273,0002,113,536
7May 16, 2026 19:4918,173158,679,597147,766,0001,254,0002,113,536
8May 16, 2026 19:4918,218158,160,749148,121,0001,269,0002,113,536
9May 16, 2026 19:4918,238158,407,665148,314,0001,238,0002,113,536