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 listMar 12, 2026 20:36Josu San MartinJosu San MartinScore: 3,828Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 20:363,82263,007,76329,320,0002,022,0002,400,256
2Mar 12, 2026 20:363,82862,797,55925,314,0006,075,0002,330,624
3Mar 12, 2026 20:363,88258,280,97428,851,0002,984,0002,461,696