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 1, 2026 22:46Code HintsCode HintsScore: 16,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2026 22:4716,228142,415,393133,689,0001,004,0002,113,536
2Jul 1, 2026 22:4716,254142,902,927133,909,0001,005,0002,113,536
3Jul 1, 2026 22:4716,260144,219,039133,961,0001,005,0002,113,536
4Jul 1, 2026 22:4716,262142,785,333133,971,0001,004,0002,113,536
5Jul 1, 2026 22:4716,278142,907,193134,106,0001,005,0002,113,536
6Jul 1, 2026 22:4716,294142,995,988134,242,0001,003,0002,113,536
7Jul 1, 2026 22:4716,312143,122,781134,391,0001,003,0002,113,536
8Jul 1, 2026 22:4716,338143,647,417134,605,0001,007,0002,113,536
9Jul 1, 2026 22:4716,357143,733,524134,765,0001,005,0002,113,536