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 20, 2026 19:03M-RochatM-RochatScore: 20,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:048,29880,165,73264,936,0003,109,0002,113,536
2May 20, 2026 19:0420,252175,489,629162,862,0003,205,0002,117,632
3May 20, 2026 19:0420,361179,123,220163,955,0003,013,0002,117,632
4May 20, 2026 19:0420,383178,560,014164,129,0003,015,0002,117,632
5May 20, 2026 19:0420,402178,318,415164,283,0003,015,0002,117,632
6May 20, 2026 19:0420,421176,870,680164,437,0003,017,0002,117,632
7May 20, 2026 19:0420,431178,617,958164,526,0003,014,0002,117,632
8May 20, 2026 19:0420,445177,278,027164,640,0003,013,0002,117,632
9May 20, 2026 19:0420,496177,498,323165,054,0003,014,0002,117,632