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 listSep 3, 2026 06:06Josu San MartinJosu San MartinScore: 3,364Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 06:073,34738,051,04626,418,0001,035,0002,117,632
2Sep 3, 2026 06:073,35138,293,10126,453,0001,033,0002,117,632
3Sep 3, 2026 06:073,35938,263,98426,492,0001,055,0002,117,632
4Sep 3, 2026 06:073,36237,477,79026,537,0001,032,0002,117,632
5Sep 3, 2026 06:073,36437,603,78226,522,0001,063,0002,117,632
6Sep 3, 2026 06:073,39637,796,54326,823,0001,032,0002,117,632
7Sep 3, 2026 06:0711,417103,584,82992,614,0001,010,0002,117,632
8Sep 3, 2026 06:0711,460103,793,54591,951,0002,022,0002,117,632
9Sep 3, 2026 06:0711,497104,329,78793,267,0001,010,0002,117,632