Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 27, 2026 18:13Victor MerckléVictor MerckléScore: 9,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 18:148,98282,740,04970,231,0004,320,0002,113,536
2Aug 27, 2026 18:148,99683,810,30770,267,0004,405,0002,113,536
3Aug 27, 2026 18:149,00483,009,78270,413,0004,328,0002,113,536
4Aug 27, 2026 18:149,01883,109,44970,493,0004,362,0002,113,536
5Aug 27, 2026 18:149,01983,150,99970,459,0004,402,0002,113,536
6Aug 27, 2026 18:149,07684,379,15471,038,0004,297,0002,113,536
7Aug 27, 2026 18:149,12384,697,92771,401,0004,326,0002,113,536
8Aug 27, 2026 18:149,13584,890,65371,358,0004,467,0002,113,536
9Aug 27, 2026 18:149,14984,236,85271,668,0004,271,0002,113,536