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 27, 2026 13:32Victor MerckléVictor MerckléScore: 3,270Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 13:333,09533,178,44924,189,0001,197,0002,113,536
2Jun 27, 2026 13:333,09933,296,94624,150,0001,269,0002,113,536
3Jun 27, 2026 13:333,11933,467,09724,561,0001,022,0002,113,536
4Jun 27, 2026 13:333,15733,764,67724,611,0001,281,0002,113,536
5Jun 27, 2026 13:333,27034,583,81925,742,0001,074,0002,113,536
6Jun 27, 2026 13:3312,096107,000,11698,187,0001,008,0002,113,536
7Jun 27, 2026 13:3312,098107,156,38798,197,0001,007,0002,113,536
8Jun 27, 2026 13:3312,205107,918,08199,075,0001,008,0002,113,536
9Jun 27, 2026 13:3312,229109,411,73999,273,0001,007,0002,113,536