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 14, 2026 00:33Victor MerckléVictor MerckléScore: 7,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 00:337,52969,904,78162,495,00002,113,536
2May 14, 2026 00:337,53171,632,06662,512,00002,113,536
3May 14, 2026 00:337,53270,290,43962,520,00002,113,536
4May 14, 2026 00:337,53371,447,26262,530,00002,113,536
5May 14, 2026 00:337,53372,618,48861,490,0001,041,0002,113,536
6May 14, 2026 00:337,53471,969,54061,532,0001,001,0002,113,536
7May 14, 2026 00:337,53571,464,75261,544,0001,002,0002,113,536
8May 14, 2026 00:337,53771,257,65861,542,0001,016,0002,113,536
9May 14, 2026 00:337,54070,091,49061,550,0001,036,0002,113,536