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 8, 2025 19:00KrishanKrishanScore: 54,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2025 19:0054,114477,845,065449,150,00002,285,568
2May 8, 2025 19:0054,170473,854,668448,613,000999,0002,502,656
3May 8, 2025 19:0054,170476,147,050447,614,0001,998,0002,285,568
4May 8, 2025 19:0054,170481,067,282448,612,000999,0002,285,568
5May 8, 2025 19:0054,174475,651,881447,650,0001,998,0002,363,392
6May 8, 2025 19:0054,176480,413,622447,665,0001,998,0002,371,584
7May 8, 2025 19:0054,184479,895,107447,731,0001,998,0002,367,488
8May 8, 2025 19:0054,194476,584,297447,808,0001,999,0002,281,472
9May 8, 2025 19:0054,194480,259,910448,813,000999,0002,285,568