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 listApr 22, 2026 02:28olliecrowolliecrowScore: 3,357Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 02:313,33945,444,53625,357,0002,028,0002,506,752
2Apr 22, 2026 02:313,34448,270,04826,409,0001,015,0002,531,328
3Apr 22, 2026 02:313,35044,922,92826,456,0001,017,0002,506,752
4Apr 22, 2026 02:313,35045,550,72226,457,0001,017,0002,490,368
5Apr 22, 2026 02:313,35741,052,65626,510,0001,019,0002,465,792
6Apr 22, 2026 02:313,35847,322,37124,480,0003,060,0002,555,904
7Apr 22, 2026 02:313,36841,008,12226,597,0001,022,0002,437,120
8Apr 22, 2026 02:313,43844,725,06226,180,0002,013,0002,547,712
9Apr 22, 2026 02:3122,789206,398,002183,879,0002,998,0002,322,432