TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listJun 19, 2026 08:15Victor MerckléVictor MerckléScore: 63,600Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 08:1663,14332,265,65823,363,00002,113,536
2Jun 19, 2026 08:1663,15930,924,57223,369,00002,113,536
3Jun 19, 2026 08:1663,16430,975,93723,371,00002,113,536
4Jun 19, 2026 08:1663,58931,024,80623,528,00002,113,536
5Jun 19, 2026 08:1663,60030,914,47523,532,00002,113,536
6Jun 19, 2026 08:1663,60831,106,14023,535,00002,113,536
7Jun 19, 2026 08:1663,76431,105,02623,593,00002,113,536
8Jun 19, 2026 08:1664,17031,228,09923,743,00002,113,536
9Jun 19, 2026 08:1664,35931,246,99923,813,00002,113,536