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 listAug 1, 2026 21:02TonyTonyScore: 52,926Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 21:0352,910449,083,247438,155,0001,003,0002,113,536
2Aug 1, 2026 21:0352,914449,121,396438,185,0001,002,0002,113,536
3Aug 1, 2026 21:0352,918449,126,813438,220,0001,002,0002,113,536
4Aug 1, 2026 21:0352,920449,218,513438,239,0001,002,0002,113,536
5Aug 1, 2026 21:0352,926449,274,415438,292,0001,002,0002,113,536
6Aug 1, 2026 21:0352,927449,271,491438,293,0001,003,0002,113,536
7Aug 1, 2026 21:0352,928449,238,600438,306,0001,003,0002,113,536
8Aug 1, 2026 21:0352,929449,782,202438,311,0001,004,0002,113,536
9Aug 1, 2026 21:0352,932449,246,546438,338,0001,003,0002,117,632