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 listMay 3, 2026 05:33limanjun99limanjun99Score: 5,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 05:335,33662,683,37840,264,0004,026,0002,379,776
2May 3, 2026 05:335,33864,671,63241,290,0003,021,0002,383,872
3May 3, 2026 05:335,34961,384,38241,300,0003,097,0002,433,024
4May 3, 2026 05:335,35763,954,46240,428,0004,042,0002,514,944
5May 3, 2026 05:335,35862,657,75741,446,0003,032,0002,400,256
6May 3, 2026 05:335,36063,386,96640,450,0004,045,0002,428,928
7May 3, 2026 05:335,36663,086,72940,495,0004,049,0002,424,832
8May 3, 2026 05:335,37563,131,50240,562,0004,056,0002,424,832
9May 3, 2026 05:335,49459,511,45641,548,0004,053,0002,420,736