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 11, 2026 15:45wnwnScore: 3,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:463,29334,620,21326,330,0001,004,0002,113,536
2May 11, 2026 15:463,29634,612,21227,363,00002,113,536
3May 11, 2026 15:463,30435,751,11727,425,00002,113,536
4May 11, 2026 15:463,31536,217,84827,520,00002,113,536
5May 11, 2026 15:463,32837,118,61527,630,00002,113,536
6May 11, 2026 15:463,33835,642,24427,708,00002,113,536
7May 11, 2026 15:463,36436,993,14526,785,0001,138,0002,113,536
8May 11, 2026 15:463,49038,654,02427,964,0001,006,0002,113,536
9May 11, 2026 15:463,49838,127,43628,038,0001,001,0002,113,536