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 listFeb 7, 2026 04:41Josu San MartinJosu San MartinScore: 3,464Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 04:413,45258,569,12027,294,0001,010,0002,338,816
2Feb 7, 2026 04:413,46456,048,57125,362,0003,043,0002,502,656
3Feb 7, 2026 04:413,46849,952,79726,405,0002,031,0002,392,064