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 19, 2026 08:22Victor MerckléVictor MerckléScore: 6,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 08:236,09959,363,29249,588,0001,039,0002,113,536
2May 19, 2026 08:236,10159,840,81549,618,0001,026,0002,113,536
3May 19, 2026 08:236,10660,077,76149,673,0001,007,0002,113,536
4May 19, 2026 08:236,11658,601,58749,751,0001,012,0002,113,536
5May 19, 2026 08:236,12160,292,27449,784,0001,024,0002,113,536
6May 19, 2026 08:236,28361,653,04851,141,0001,015,0002,113,536
7May 19, 2026 08:236,29563,041,11851,246,0001,008,0002,113,536
8May 19, 2026 08:236,31461,930,53151,368,0001,039,0002,113,536
9May 19, 2026 08:236,33663,289,02251,568,0001,029,0002,113,536