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 22, 2026 18:43Kasper KivimäkiKasper KivimäkiScore: 58,610Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 18:4457,457486,635,855475,742,0001,157,0002,113,536
2Jul 22, 2026 18:4457,888490,395,569479,472,0001,006,0002,113,536
3Jul 22, 2026 18:4458,582496,100,643485,067,0001,166,0002,113,536
4Jul 22, 2026 18:4458,603496,285,795485,403,0001,004,0002,113,536
5Jul 22, 2026 18:4458,610497,039,209485,466,0001,002,0002,113,536
6Jul 22, 2026 18:4458,650497,196,766485,525,0001,277,0002,113,536
7Jul 22, 2026 18:4458,658497,409,849485,706,0001,163,0002,113,536
8Jul 22, 2026 18:4458,678496,941,931486,024,0001,004,0002,113,536
9Jul 22, 2026 18:4458,712497,287,052486,117,0001,199,0002,113,536