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 18, 2026 23:15Victor MerckléVictor MerckléScore: 64,810Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 23:1663,91032,245,88423,647,00002,113,536
2Jun 18, 2026 23:1664,51831,393,06723,872,00002,113,536
3Jun 18, 2026 23:1664,62131,432,07623,910,00002,113,536
4Jun 18, 2026 23:1664,75131,512,53523,958,00002,113,536
5Jun 18, 2026 23:1664,81031,603,24923,980,00002,113,536
6Jun 18, 2026 23:1664,83531,549,80623,989,00002,113,536
7Jun 18, 2026 23:1664,94531,561,79224,030,00002,113,536
8Jun 18, 2026 23:1665,03531,546,35024,063,00002,113,536
9Jun 18, 2026 23:1665,09431,629,41524,085,00002,113,536