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 listFeb 15, 2026 23:16wnwnScore: 8,455Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:167,23486,785,48151,037,0009,006,0002,424,832
2Feb 15, 2026 23:167,37587,045,09253,183,0008,027,0002,285,568
3Feb 15, 2026 23:167,37990,575,19252,210,0009,036,0002,277,376
4Feb 15, 2026 23:168,45594,540,84762,155,0008,020,0002,318,336
5Feb 15, 2026 23:168,503101,495,43661,503,0009,074,0002,383,872
6Feb 15, 2026 23:168,59397,514,61262,282,0009,041,0002,412,544