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 18:57boop34boop34Score: 21,987Success
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 18:5821,974192,195,839181,268,0001,118,0002,113,536
2Jul 30, 2026 18:5821,979195,586,761181,214,0001,217,0002,113,536
3Jul 30, 2026 18:5821,984192,450,604181,266,0001,208,0002,113,536
4Jul 30, 2026 18:5821,987192,304,327181,362,0001,136,0002,113,536
5Jul 30, 2026 18:5821,987194,271,962181,402,0001,097,0002,113,536
6Jul 30, 2026 18:5821,993192,382,847181,478,0001,071,0002,113,536
7Jul 30, 2026 18:5821,998192,496,658181,479,0001,109,0002,113,536
8Jul 30, 2026 18:5822,000192,470,632181,423,0001,185,0002,113,536
9Jul 30, 2026 18:5822,002192,444,218181,616,0001,005,0002,113,536