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 listMar 7, 2026 05:33Josu San MartinJosu San MartinScore: 5,187Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2026 05:334,93767,396,22438,976,0001,998,0002,416,640
2Mar 7, 2026 05:335,16170,160,09340,848,0001,992,0002,408,448
3Mar 7, 2026 05:335,16663,397,53240,887,0001,994,0002,281,472
4Mar 7, 2026 05:335,18765,420,55642,051,0001,001,0002,281,472
5Mar 7, 2026 05:335,22366,410,75642,342,0001,008,0002,281,472
6Mar 7, 2026 05:335,28769,207,46841,889,0001,994,0002,281,472