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 listApr 27, 2026 10:20wnwnScore: 3,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:203,40146,365,48227,228,0001,008,0002,326,528
2Apr 27, 2026 10:203,44947,410,69227,607,0001,022,0002,486,272
3Apr 27, 2026 10:203,46644,308,69927,745,0001,027,0002,490,368
4Apr 27, 2026 10:203,48745,107,57426,951,0001,996,0002,478,080
5Apr 27, 2026 10:203,48741,738,31027,950,000998,0002,330,624
6Apr 27, 2026 10:203,49847,831,14528,034,0001,001,0002,330,624
7Apr 27, 2026 10:203,55045,395,45829,473,00002,326,528
8Apr 27, 2026 10:203,61549,068,60128,012,0002,000,0002,473,984
9Apr 27, 2026 10:203,64846,936,10929,273,0001,009,0002,486,272