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 13:07Victor MerckléVictor MerckléScore: 3,877Success
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 13:083,83340,213,71730,730,0001,089,0002,117,632stderr
2Aug 11, 2026 13:083,83640,249,65330,756,0001,083,0002,117,632stderr
3Aug 11, 2026 13:083,87040,647,58631,052,0001,075,0002,117,632stderr
4Aug 11, 2026 13:083,87140,544,05630,976,0001,154,0002,117,632stderr
5Aug 11, 2026 13:083,87740,604,07331,052,0001,131,0002,117,632stderr
6Aug 11, 2026 13:083,88140,609,25931,048,0001,170,0002,117,632stderr
7Aug 11, 2026 13:083,90440,801,51931,228,0001,179,0002,117,632stderr
8Aug 11, 2026 13:083,91440,915,91331,339,0001,155,0002,117,632stderr
9Aug 11, 2026 13:083,97341,374,69831,908,0001,075,0002,117,632stderr