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 listDec 21, 2024 02:34rimuspprimusppScore: 598,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2024 02:34598,5424,987,461,3134,967,902,00002,478,080
2Dec 21, 2024 02:34598,5454,995,332,3564,966,926,000999,0002,527,232
3Dec 21, 2024 02:34598,5834,996,341,2114,968,237,00002,527,232
4Dec 21, 2024 02:34598,6224,998,712,2614,968,566,00002,473,984
5Dec 21, 2024 02:34598,6904,992,604,3734,966,134,0002,997,0002,265,088
6Dec 21, 2024 02:34598,7484,994,778,3174,968,611,000999,0002,265,088
7Dec 21, 2024 02:34598,7625,002,189,5414,966,727,0002,997,0002,265,088
8Dec 21, 2024 02:34598,8054,995,477,5504,969,080,000999,0002,527,232
9Dec 21, 2024 02:34600,1595,012,357,6874,972,328,0008,993,0002,473,984