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 17, 2026 02:26M-RochatM-RochatScore: 14,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 02:2813,480119,437,814102,549,0007,987,0002,113,536
2May 17, 2026 02:2813,609120,406,782103,619,0007,978,0002,113,536
3May 17, 2026 02:2813,664121,443,062104,332,0007,714,0002,113,536
4May 17, 2026 02:2813,906122,806,780106,025,0008,012,0002,113,536
5May 17, 2026 02:2814,072126,618,542107,460,0007,932,0002,113,536
6May 17, 2026 02:2818,312161,684,192142,074,0008,087,0002,117,632
7May 17, 2026 02:2818,533160,806,569144,620,0007,356,0002,117,632
8May 17, 2026 02:2818,584161,170,440144,456,0007,933,0002,117,632
9May 17, 2026 02:2818,834163,298,920146,443,0007,997,0002,117,632