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 17, 2026 14:20Kevin HeaveyKevin HeaveyScore: 3,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 14:333,67040,417,07329,418,0001,051,0002,113,536
2Jul 17, 2026 14:333,68540,488,08229,539,0001,049,0002,113,536
3Jul 17, 2026 14:333,68843,574,94829,568,0001,049,0002,113,536
4Jul 17, 2026 14:333,69840,549,57329,647,0001,053,0002,113,536
5Jul 17, 2026 14:333,71740,691,84529,808,0001,046,0002,113,536
6Jul 17, 2026 14:333,72741,680,62329,892,0001,048,0002,113,536
7Jul 17, 2026 14:333,84641,753,29030,871,0001,055,0002,113,536
8Jul 17, 2026 14:333,96443,322,88631,859,0001,045,0002,113,536
9Jul 17, 2026 14:334,04343,385,94332,518,0001,046,0002,113,536