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 listOct 20, 2026 07:33e1011e1011Score: 84,381Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 07:3483,42142,303,13729,677,0001,189,0002,113,536
2Oct 20, 2026 07:3483,66242,416,87629,764,0001,191,0002,113,536
3Oct 20, 2026 07:3484,09142,550,02129,908,0001,206,0002,113,536
4Oct 20, 2026 07:3484,34042,626,30630,007,0001,199,0002,113,536
5Oct 20, 2026 07:3484,38142,675,06530,030,0001,191,0002,113,536
6Oct 20, 2026 07:3484,41842,705,76830,028,0001,207,0002,113,536
7Oct 20, 2026 07:3494,52445,822,35933,856,0001,118,0002,113,536
8Oct 20, 2026 07:3494,97246,072,59334,122,0001,018,0002,113,536
9Oct 20, 2026 07:3495,72946,842,00034,218,0001,202,0002,113,536