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 22, 2026 08:05Victor MerckléVictor MerckléScore: 4,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 08:054,60347,997,99137,140,0001,069,0002,113,536
2May 22, 2026 08:054,60549,110,37037,165,0001,059,0002,113,536
3May 22, 2026 08:054,60647,081,31337,171,0001,059,0002,113,536
4May 22, 2026 08:054,60947,408,89437,198,0001,058,0002,113,536
5May 22, 2026 08:054,61348,718,28737,240,0001,055,0002,113,536
6May 22, 2026 08:054,61948,819,47637,275,0001,065,0002,113,536
7May 22, 2026 08:054,65647,745,02637,594,0001,056,0002,113,536
8May 22, 2026 08:054,74249,960,53338,299,0001,063,0002,113,536
9May 22, 2026 08:054,81450,784,87138,957,0001,003,0002,113,536