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 18, 2026 03:55M-RochatM-RochatScore: 22,440Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 03:5710,42697,689,48079,706,0005,794,0002,113,536
2May 18, 2026 03:5710,43297,391,57879,814,0005,733,0002,113,536
3May 18, 2026 03:5710,55898,410,60180,686,0005,892,0002,113,536
4May 18, 2026 03:5722,378192,883,121176,625,0006,877,0002,117,632
5May 18, 2026 03:5722,440197,064,762177,131,0006,880,0002,117,632
6May 18, 2026 03:5722,481194,012,421177,549,0006,802,0002,117,632
7May 18, 2026 03:5722,486194,201,942177,580,0006,812,0002,117,632
8May 18, 2026 03:5722,499198,081,699177,301,0007,194,0002,117,632
9May 18, 2026 03:5722,568194,532,032178,094,0006,969,0002,117,632