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 12, 2026 18:45Victor MerckléVictor MerckléScore: 9,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 18:469,35589,429,35176,537,0001,117,0002,113,536
2May 12, 2026 18:469,35686,445,75476,557,0001,100,0002,113,536
3May 12, 2026 18:469,36286,989,53176,539,0001,169,0002,113,536
4May 12, 2026 18:469,36387,046,71776,547,0001,169,0002,113,536
5May 12, 2026 18:469,36387,794,15876,539,0001,177,0002,113,536
6May 12, 2026 18:469,36888,011,83876,753,0001,003,0002,113,536
7May 12, 2026 18:469,37189,413,44076,777,0001,004,0002,113,536
8May 12, 2026 18:469,37786,620,81076,825,0001,006,0002,113,536
9May 12, 2026 18:469,38088,994,33076,748,0001,111,0002,113,536