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 07:16Kevin HeaveyKevin HeaveyScore: 3,350Success
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 07:253,32336,281,76226,444,0001,143,0002,113,536
2Sep 23, 2026 07:253,33136,503,99326,480,0001,172,0002,113,536
3Sep 23, 2026 07:253,33837,255,11126,690,0001,020,0002,113,536
4Sep 23, 2026 07:253,34236,508,83626,700,0001,044,0002,113,536
5Sep 23, 2026 07:253,35036,895,38326,791,0001,021,0002,113,536
6Sep 23, 2026 07:253,35537,944,30126,699,0001,149,0002,113,536
7Sep 23, 2026 07:253,35537,139,54726,826,0001,022,0002,113,536
8Sep 23, 2026 07:253,35737,411,02526,824,0001,045,0002,113,536
9Sep 23, 2026 07:253,36137,847,76826,878,0001,026,0002,113,536