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 18, 2026 05:53Kevin HeaveyKevin HeaveyScore: 3,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 05:593,64940,128,43629,250,0001,044,0002,113,536
2Jul 18, 2026 05:593,66240,193,24529,348,0001,048,0002,113,536
3Jul 18, 2026 05:593,67840,434,75429,488,0001,047,0002,113,536
4Jul 18, 2026 05:593,68140,386,48329,506,0001,047,0002,113,536
5Jul 18, 2026 05:593,72042,418,91529,835,0001,047,0002,113,536
6Jul 18, 2026 05:593,73740,895,46929,980,0001,043,0002,113,536
7Jul 18, 2026 05:593,84143,060,90230,836,0001,045,0002,113,536
8Jul 18, 2026 05:593,93243,850,87131,596,0001,045,0002,113,536
9Jul 18, 2026 05:593,94542,534,23631,696,0001,049,0002,113,536