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 13, 2026 18:49boop34boop34Score: 20,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2026 18:5020,283179,397,620167,343,0001,011,0002,113,536
2Jul 13, 2026 18:5020,292178,722,288167,413,0001,012,0002,113,536
3Jul 13, 2026 18:5020,296178,760,736167,448,0001,012,0002,113,536
4Jul 13, 2026 18:5020,497180,454,367168,112,0002,018,0002,113,536
5Jul 13, 2026 18:5020,761182,542,301171,306,0001,011,0002,113,536
6Jul 13, 2026 18:5020,765182,107,559171,343,0001,011,0002,113,536
7Jul 13, 2026 18:5020,766182,375,911171,358,0001,008,0002,113,536
8Jul 13, 2026 18:5020,768182,715,671171,365,0001,010,0002,113,536
9Jul 13, 2026 18:5020,780182,257,757170,418,0002,056,0002,113,536