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 listSep 3, 2026 11:59Josu San MartinJosu San MartinScore: 11,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 12:003,46138,529,13727,354,0001,034,0002,113,536
2Sep 3, 2026 12:0010,37895,515,50179,530,0005,577,0002,113,536
3Sep 3, 2026 12:0010,53196,380,14780,931,0005,424,0002,113,536
4Sep 3, 2026 12:0010,79398,481,56682,787,0005,718,0002,113,536
5Sep 3, 2026 12:0011,080100,968,34584,687,0006,176,0002,113,536
6Sep 3, 2026 12:0011,676105,902,51189,116,0006,634,0002,113,536
7Sep 3, 2026 12:0023,047199,001,694182,382,0006,608,0002,117,632
8Sep 3, 2026 12:0023,231200,492,295183,807,0006,688,0002,113,536
9Sep 3, 2026 12:0023,364201,680,792184,895,0006,696,0002,117,632