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 listJul 3, 2026 02:42f0xerif0xeriScore: 22,383,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 02:5422,374,4488,288,268,7598,118,849,000159,697,0002,113,536
2Jul 3, 2026 02:5422,383,8948,292,103,5518,126,233,000155,808,0002,113,536
3Jul 3, 2026 02:5422,414,2818,303,344,7768,138,804,000154,480,0002,113,536