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 22, 2025 03:30Josu San MartinJosu San MartinScore: 70,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 03:3070,555613,588,774524,648,00060,959,0002,326,528
2Dec 22, 2025 03:3070,626611,178,114526,175,00060,019,0002,260,992
3Dec 22, 2025 03:3070,876608,557,769524,245,00064,029,0002,326,528