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:17Mehdi-Dehghan-FooladiMehdi-Dehghan-FooladiScore: 41,198Success
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:1840,319351,805,016327,626,0002,996,0002,498,560
2May 1, 2026 21:1840,501348,149,161330,109,0002,000,0002,498,560
3May 1, 2026 21:1841,057352,284,906333,678,0002,997,0002,490,368
4May 1, 2026 21:1841,078357,862,692334,844,0001,999,0002,498,560
5May 1, 2026 21:1841,198356,092,063334,818,0003,007,0002,494,464
6May 1, 2026 21:1841,378356,592,470337,304,0002,001,0002,301,952
7May 1, 2026 21:1841,460359,979,018336,975,0002,999,0002,490,368
8May 1, 2026 21:1841,473357,843,397340,079,00002,322,432
9May 1, 2026 21:1841,820360,375,958338,928,0003,999,0002,494,464