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 3, 2026 16:25TudyMTudyMScore: 12,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 16:3512,146116,881,20798,336,0001,265,0002,551,808
2May 3, 2026 16:3512,151117,015,50398,628,0001,011,0002,547,712
3May 3, 2026 16:3512,153118,116,82398,382,0001,275,0002,568,192
4May 3, 2026 16:3512,161115,701,19198,468,0001,253,0002,560,000
5May 3, 2026 16:3512,166113,720,18998,523,0001,240,0002,560,000
6May 3, 2026 16:3512,169116,017,81398,541,0001,252,0002,539,520
7May 3, 2026 16:3512,182117,179,45298,611,0001,284,0002,543,616
8May 3, 2026 16:3512,194114,094,81498,748,0001,246,0002,306,048
9May 3, 2026 16:3512,195115,308,60998,730,0001,274,0002,547,712