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 12:47Josu San MartinJosu San MartinScore: 3,683Success
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 12:513,57640,154,21228,238,0001,086,0002,113,536
2Sep 3, 2026 12:513,62039,743,19028,642,0001,049,0002,113,536
3Sep 3, 2026 12:513,65140,742,73228,861,0001,084,0002,113,536
4Sep 3, 2026 12:513,67340,923,98129,046,0001,076,0002,113,536
5Sep 3, 2026 12:513,68342,775,92629,109,0001,092,0002,113,536
6Sep 3, 2026 12:513,70440,786,87229,281,0001,095,0002,113,536
7Sep 3, 2026 12:513,71240,574,15029,366,0001,080,0002,113,536
8Sep 3, 2026 12:5114,398128,152,684117,039,0001,032,0002,113,536
9Sep 3, 2026 12:5114,575129,557,751118,466,0001,051,0002,113,536