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 listOct 14, 2026 22:47e1011e1011Score: 65,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 22:4765,943557,994,487493,943,00053,386,0002,113,536
2Oct 14, 2026 22:4765,951558,671,419493,192,00054,204,0002,113,536
3Oct 14, 2026 22:4765,970558,085,628493,352,00054,200,0002,113,536
4Oct 14, 2026 22:4765,987558,919,840493,409,00054,285,0002,113,536
5Oct 14, 2026 22:4765,989558,982,486493,455,00054,260,0002,113,536
6Oct 14, 2026 22:4765,994559,032,171493,466,00054,288,0002,113,536
7Oct 14, 2026 22:4765,999558,447,817493,582,00054,211,0002,113,536
8Oct 14, 2026 22:4766,000558,413,800493,489,00054,318,0002,113,536
9Oct 14, 2026 22:4766,012559,098,254493,674,00054,230,0002,113,536