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 23, 2026 08:44Kevin HeaveyKevin HeaveyScore: 3,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 08:473,23035,732,27525,712,0001,103,0002,113,536
2Sep 23, 2026 08:473,23835,547,95025,754,0001,129,0002,113,536
3Sep 23, 2026 08:473,24737,103,69125,865,0001,092,0002,113,536
4Sep 23, 2026 08:473,25536,033,44825,986,0001,034,0002,113,536
5Sep 23, 2026 08:473,26336,618,51626,072,0001,011,0002,113,536
6Sep 23, 2026 08:473,26536,741,46125,905,0001,199,0002,113,536
7Sep 23, 2026 08:473,26936,767,14226,078,0001,061,0002,113,536
8Sep 23, 2026 08:473,27035,868,42025,965,0001,181,0002,113,536
9Sep 23, 2026 08:473,27135,794,59425,984,0001,168,0002,113,536