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:27M-RochatM-RochatScore: 17,973Success
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:3013,065115,900,95599,957,0007,180,0002,113,536
2May 17, 2026 02:3013,187118,654,549101,274,0006,865,0002,113,536
3May 17, 2026 02:3013,216119,352,124101,358,0007,017,0002,113,536
4May 17, 2026 02:3017,792156,127,480139,164,0006,733,0002,117,632
5May 17, 2026 02:3017,973156,143,620140,522,0006,863,0002,117,632
6May 17, 2026 02:3017,980156,303,092139,575,0007,867,0002,117,632
7May 17, 2026 02:3018,005156,364,673140,840,0006,806,0002,117,632
8May 17, 2026 02:3018,114157,392,318140,618,0007,923,0002,117,632
9May 17, 2026 02:3018,387159,615,490142,955,0007,826,0002,117,632