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 21, 2026 12:15Victor MerckléVictor MerckléScore: 4,671Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 12:164,64346,383,88337,488,0001,053,0002,113,536
2May 21, 2026 12:164,65046,544,01437,523,0001,075,0002,113,536
3May 21, 2026 12:164,66447,580,84637,606,0001,107,0002,113,536
4May 21, 2026 12:164,66547,683,64637,649,0001,074,0002,113,536
5May 21, 2026 12:164,67146,615,48837,760,0001,012,0002,113,536
6May 21, 2026 12:164,67447,011,83137,724,0001,075,0002,113,536
7May 21, 2026 12:164,69646,846,49737,942,0001,041,0002,113,536
8May 21, 2026 12:164,72247,067,27338,161,0001,036,0002,113,536
9May 21, 2026 12:164,80347,725,13638,840,0001,027,0002,113,536