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 listJun 12, 2026 09:20Victor MerckléVictor MerckléScore: 3,465Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 09:273,37035,234,80026,574,0001,062,0002,113,536
2Jun 12, 2026 09:273,37535,179,41826,610,0001,065,0002,113,536
3Jun 12, 2026 09:273,37935,205,71626,640,0001,069,0002,113,536
4Jun 12, 2026 09:273,46135,935,32827,340,0001,047,0002,113,536
5Jun 12, 2026 09:273,46535,941,73327,351,0001,066,0002,113,536
6Jun 12, 2026 09:273,47336,025,58827,452,0001,030,0002,113,536
7Jun 12, 2026 09:273,49236,153,27627,601,0001,034,0002,113,536
8Jun 12, 2026 09:276,51461,006,70952,397,0001,018,0002,113,536
9Jun 12, 2026 09:2712,948113,764,403104,162,0002,017,0002,113,536