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 listApr 24, 2026 14:12TudyMTudyMScore: 58,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 14:1358,094504,573,955481,181,0001,000,0002,363,392
2Apr 24, 2026 14:1358,103503,258,788481,258,0001,000,0002,375,680
3Apr 24, 2026 14:1358,106496,585,447480,284,0002,001,0002,367,488
4Apr 24, 2026 14:1358,115502,803,849479,360,0003,002,0002,367,488
5Apr 24, 2026 14:1358,127502,446,915482,455,00002,367,488
6Apr 24, 2026 14:1358,144502,941,988480,598,0001,998,0002,293,760
7Apr 24, 2026 14:1358,175499,971,580480,857,0001,999,0002,555,904
8Apr 24, 2026 14:1358,178500,566,460480,881,0001,999,0002,363,392
9Apr 24, 2026 14:1358,200499,057,226481,060,0002,000,0002,367,488