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 listFeb 24, 2026 16:36spatialspatialScore: 84,054Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 16:3683,609717,585,332636,961,00056,996,0002,293,760
2Feb 24, 2026 16:3684,054729,321,500631,684,00065,967,0002,306,048
3Feb 24, 2026 16:3685,307736,768,866647,048,00061,004,0002,293,760