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 listFeb 27, 2026 04:20user76135user76135Score: 72,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 04:2072,282625,761,970524,946,00074,992,0002,330,624
2Feb 27, 2026 04:2072,375624,910,149523,753,00076,963,0002,400,256
3Feb 27, 2026 04:2072,637634,212,987523,902,00078,985,0002,347,008