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 2, 2026 20:05TonyTonyScore: 9,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:069,44388,232,98875,736,0002,643,0002,113,536
2Aug 2, 2026 20:069,45388,321,50075,821,0002,640,0002,113,536
3Aug 2, 2026 20:069,45588,340,82775,804,0002,674,0002,113,536
4Aug 2, 2026 20:069,45788,371,84875,862,0002,639,0002,113,536
5Aug 2, 2026 20:069,48188,503,15576,035,0002,662,0002,113,536
6Aug 2, 2026 20:069,52188,874,41876,360,0002,665,0002,113,536
7Aug 2, 2026 20:069,53188,940,33576,419,0002,692,0002,113,536
8Aug 2, 2026 20:069,55189,079,01976,620,0002,654,0002,113,536
9Aug 2, 2026 20:069,56389,202,23977,355,0002,022,0002,113,536