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 5, 2025 08:47warshipwarshipScore: 67,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 08:4767,539586,646,755558,579,0001,998,0002,277,376
2Dec 5, 2025 08:4767,571586,049,386558,841,0001,999,0002,285,568
3Dec 5, 2025 08:4767,572582,327,700558,850,0001,999,0002,277,376
4Dec 5, 2025 08:4767,597584,908,841560,058,0001,000,0002,285,568
5Dec 5, 2025 08:4767,622587,881,223560,266,0001,000,0002,523,136
6Dec 5, 2025 08:4767,657586,782,962559,551,0001,998,0002,519,040
7Dec 5, 2025 08:4767,694587,448,163559,863,0001,999,0002,285,568
8Dec 5, 2025 08:4767,722587,396,811561,094,0001,000,0002,260,992
9Dec 5, 2025 08:4767,839588,340,029561,063,0002,000,0002,285,568