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 14, 2026 21:22Kevin HeaveyKevin HeaveyScore: 3,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 21:233,68140,113,94529,531,0001,027,0002,117,632
2Jul 14, 2026 21:233,68940,191,16529,603,0001,022,0002,117,632
3Jul 14, 2026 21:233,69740,286,44629,664,0001,024,0002,117,632
4Jul 14, 2026 21:233,70540,570,36229,724,0001,028,0002,117,632
5Jul 14, 2026 21:233,71040,486,20929,765,0001,028,0002,117,632
6Jul 14, 2026 21:233,71540,419,70129,813,0001,027,0002,117,632
7Jul 14, 2026 21:233,75540,789,73230,131,0001,041,0002,117,632
8Jul 14, 2026 21:233,78641,013,75630,383,0001,041,0002,117,632
9Jul 14, 2026 21:233,79441,167,07730,447,0001,045,0002,117,632