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 listMar 30, 2026 11:32Dominique GarmierDominique GarmierScore: 79,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 07:4677,96854,695,92427,854,000994,0002,342,912
2Mar 30, 2026 11:3278,23258,712,06326,950,0001,996,0002,449,408
3Mar 30, 2026 07:4679,48449,577,28427,381,0002,028,0002,424,832
4Mar 30, 2026 07:4679,69553,514,20128,471,0001,016,0002,322,432
5Mar 30, 2026 11:3279,92757,786,94028,554,0001,019,0002,371,584
6Mar 30, 2026 11:3280,61156,983,61827,838,0001,988,0002,306,048