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 2, 2026 13:35limanjun99limanjun99Score: 20,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2026 13:3520,184187,107,955166,531,0001,003,0002,461,696
2May 2, 2026 13:3520,186188,457,085164,553,0002,991,0002,457,600
3May 2, 2026 13:3520,186186,929,579165,542,0002,006,0002,469,888
4May 2, 2026 13:3520,189185,897,954165,570,0002,006,0002,469,888
5May 2, 2026 13:3520,190188,535,422165,572,0002,006,0002,473,984
6May 2, 2026 13:3520,198185,979,455164,651,0002,993,0002,465,792
7May 2, 2026 13:3520,593188,605,017167,930,0002,998,0002,461,696
8May 2, 2026 13:3520,602191,821,103168,002,0003,000,0002,334,720
9May 2, 2026 13:3520,610187,444,882168,063,0003,001,0002,465,792