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 listJun 10, 2026 15:37Victor MerckléVictor MerckléScore: 6,420Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:376,40660,757,16752,122,0001,053,0002,113,536
2Jun 10, 2026 15:376,40661,134,61652,137,0001,040,0002,113,536
3Jun 10, 2026 15:376,40861,634,21852,149,0001,045,0002,113,536
4Jun 10, 2026 15:376,41861,190,64252,216,0001,054,0002,113,536
5Jun 10, 2026 15:376,42061,252,93252,237,0001,053,0002,113,536
6Jun 10, 2026 15:376,42060,902,27752,245,0001,043,0002,113,536
7Jun 10, 2026 15:376,42560,944,59452,265,0001,063,0002,113,536
8Jun 10, 2026 15:376,42661,255,69052,297,0001,044,0002,113,536
9Jun 10, 2026 15:376,42661,224,38552,196,0001,140,0002,113,536