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 listSep 6, 2026 09:38Kevin HeaveyKevin HeaveyScore: 3,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 09:393,52639,198,70428,193,0001,081,0002,113,536
2Sep 6, 2026 09:393,53637,702,57928,128,0001,226,0002,113,536
3Sep 6, 2026 09:393,53737,908,66628,142,0001,219,0002,113,536
4Sep 6, 2026 09:393,54637,786,28328,199,0001,238,0002,113,536
5Sep 6, 2026 09:393,56339,556,41028,479,0001,094,0002,113,536
6Sep 6, 2026 09:393,59039,943,52128,762,0001,040,0002,113,536
7Sep 6, 2026 09:393,61040,056,63828,915,0001,050,0002,113,536
8Sep 6, 2026 09:393,76142,486,66329,983,0001,238,0002,113,536
9Sep 6, 2026 09:393,78741,943,64630,394,0001,041,0002,113,536