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 20, 2026 05:28M-RochatM-RochatScore: 15,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:2815,534139,736,738119,805,0009,135,0002,146,304
2May 20, 2026 05:2815,548138,657,066119,917,0009,138,0002,138,112
3May 20, 2026 05:2815,568138,748,956120,220,0008,995,0002,146,304
4May 20, 2026 05:2815,613142,020,102120,393,0009,203,0002,138,112
5May 20, 2026 05:2815,662140,756,770120,881,0009,114,0002,138,112
6May 20, 2026 05:2815,675141,853,085121,061,0009,044,0002,138,112
7May 20, 2026 05:2815,726144,308,454121,359,0009,170,0002,138,112
8May 20, 2026 05:2815,756140,466,573121,719,0009,056,0002,138,112
9May 20, 2026 05:2815,884142,099,211122,900,0008,945,0002,138,112