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 6, 2026 01:13Victor MerckléVictor MerckléScore: 3,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 01:133,36636,767,04626,556,0001,046,0002,113,536
2Jun 6, 2026 01:133,37336,770,67026,617,0001,045,0002,113,536
3Jun 6, 2026 01:133,41237,170,44226,908,0001,074,0002,113,536
4Jun 6, 2026 01:133,43037,274,81426,068,0002,061,0002,113,536
5Jun 6, 2026 01:133,44537,422,52726,171,0002,085,0002,113,536
6Jun 6, 2026 01:133,50337,883,09027,674,0001,055,0002,113,536
7Jun 6, 2026 01:133,51137,924,14727,739,0001,059,0002,113,536
8Jun 6, 2026 01:133,56338,265,53327,134,0002,086,0002,113,536
9Jun 6, 2026 01:1312,847114,525,597103,314,0002,034,0002,113,536