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 listJul 30, 2026 19:55boop34boop34Score: 8,291Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 19:558,25978,444,92067,430,0001,124,0002,113,536
2Jul 30, 2026 19:558,27078,586,93267,443,0001,199,0002,113,536
3Jul 30, 2026 19:558,28078,661,54267,531,0001,199,0002,113,536
4Jul 30, 2026 19:558,28678,756,98667,656,0001,122,0002,113,536
5Jul 30, 2026 19:558,29178,713,31667,697,0001,121,0002,113,536
6Jul 30, 2026 19:558,29278,701,46067,670,0001,154,0002,113,536
7Jul 30, 2026 19:558,34280,615,30567,985,0001,254,0002,113,536
8Jul 30, 2026 19:558,36079,309,63868,271,0001,123,0002,113,536
9Jul 30, 2026 19:558,41779,735,64668,758,0001,111,0002,113,536