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 23, 2026 19:17Victor MerckléVictor MerckléScore: 3,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:193,75939,441,60330,094,0001,106,0002,117,632stderr
2Aug 23, 2026 19:193,76139,587,78830,132,0001,088,0002,117,632stderr
3Aug 23, 2026 19:193,76439,603,56030,147,0001,096,0002,117,632stderr
4Aug 23, 2026 19:193,77139,740,09730,286,0001,021,0002,117,632stderr
5Aug 23, 2026 19:193,77739,743,97230,266,0001,085,0002,117,632stderr
6Aug 23, 2026 19:193,78339,855,12630,283,0001,117,0002,117,632stderr
7Aug 23, 2026 19:193,79239,880,34630,408,0001,068,0002,117,632stderr
8Aug 23, 2026 19:193,80840,008,35730,469,0001,138,0002,117,632stderr
9Aug 23, 2026 19:193,88440,615,77731,227,0001,016,0002,117,632stderr