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 08:44Pavel SkripkinPavel SkripkinScore: 5,102Success
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 08:444,98555,302,88334,495,0006,385,0002,318,336
2May 10, 2026 08:445,02654,270,76734,402,0006,816,0002,383,872
3May 10, 2026 08:445,07257,200,64734,808,0006,784,0002,482,176
4May 10, 2026 08:445,09155,446,83834,706,0007,045,0002,523,136
5May 10, 2026 08:445,10256,916,10035,040,0006,802,0002,355,200
6May 10, 2026 08:445,10655,045,48735,261,0006,609,0002,338,816
7May 10, 2026 08:445,11657,621,78834,994,0006,961,0002,342,912
8May 10, 2026 08:445,40758,246,82236,463,0007,878,0002,363,392
9May 10, 2026 08:445,45659,725,04336,693,0008,047,0002,404,352