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 10, 2026 13:20Pavel SkripkinPavel SkripkinScore: 24,881Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:214,11040,997,21230,618,0003,090,0002,117,632
2May 10, 2026 13:214,14942,744,66230,958,0003,064,0002,117,632
3May 10, 2026 13:2124,155205,293,122193,883,0004,196,0002,117,632
4May 10, 2026 13:2124,356206,937,291196,445,0003,281,0002,117,632
5May 10, 2026 13:2124,881212,282,621201,016,0003,012,0002,117,632
6May 10, 2026 13:2125,060215,087,698201,487,0004,010,0002,117,632
7May 10, 2026 13:2125,278214,591,188204,269,0003,015,0002,117,632
8May 10, 2026 13:2125,512219,295,669205,049,0004,156,0002,117,632
9May 10, 2026 13:2125,691219,066,355207,481,0003,187,0002,117,632