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 1, 2026 21:32Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiScore: 107,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 21:3383,146700,849,309543,839,000137,959,0002,535,424
2May 1, 2026 21:3386,461728,690,155565,192,000143,794,0002,322,432
3May 1, 2026 21:3389,646756,657,751596,270,000138,830,0002,535,424
4May 1, 2026 21:3393,044778,188,469617,164,000145,802,0002,547,712
5May 1, 2026 21:33107,240899,099,969742,472,000136,902,0002,539,520
6May 1, 2026 21:33111,291930,941,528773,651,000138,937,0002,535,424
7May 1, 2026 21:33111,335933,510,608773,109,000139,838,0002,527,232
8May 1, 2026 21:33111,492931,660,890770,358,000143,880,0002,531,328
9May 1, 2026 21:33115,561966,428,639807,665,000139,942,0002,535,424