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 11, 2026 14:12Victor MerckléVictor MerckléScore: 3,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 14:133,93841,073,27231,624,0001,068,0002,117,632stderr
2Aug 11, 2026 14:133,94141,089,20631,682,0001,036,0002,117,632stderr
3Aug 11, 2026 14:133,95041,167,16531,741,0001,044,0002,117,632stderr
4Aug 11, 2026 14:133,95041,185,03231,666,0001,126,0002,117,632stderr
5Aug 11, 2026 14:133,95641,288,69831,644,0001,196,0002,117,632stderr
6Aug 11, 2026 14:133,95641,191,85631,803,0001,032,0002,117,632stderr
7Aug 11, 2026 14:133,99541,576,66532,067,0001,099,0002,117,632stderr
8Aug 11, 2026 14:133,99741,606,17432,116,0001,066,0002,117,632stderr
9Aug 11, 2026 14:134,04542,049,18232,523,0001,054,0002,117,632stderr