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 19:07boop34boop34Score: 20,587Success
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 19:0820,077178,598,524165,632,0001,010,0002,113,536
2Jul 13, 2026 19:0820,573180,870,176169,754,0001,010,0002,113,536
3Jul 13, 2026 19:0820,585180,682,277169,851,0001,010,0002,113,536
4Jul 13, 2026 19:0820,585181,240,818169,845,0001,011,0002,113,536
5Jul 13, 2026 19:0820,587189,625,429169,867,0001,008,0002,113,536
6Jul 13, 2026 19:0820,591180,668,575169,902,0001,011,0002,113,536
7Jul 13, 2026 19:0820,594181,269,926169,920,0001,011,0002,113,536
8Jul 13, 2026 19:0820,597181,207,225169,952,0001,011,0002,113,536
9Jul 13, 2026 19:0820,644181,707,964170,340,0001,010,0002,113,536