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 28, 2026 05:05Victor MerckléVictor MerckléScore: 3,706Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 05:063,69638,943,78029,542,0001,142,0002,113,536
2Aug 28, 2026 05:063,69938,907,22629,630,0001,075,0002,113,536
3Aug 28, 2026 05:063,70539,503,19129,692,0001,067,0002,113,536
4Aug 28, 2026 05:063,70538,990,64729,618,0001,141,0002,113,536
5Aug 28, 2026 05:063,70638,919,98129,674,0001,092,0002,113,536
6Aug 28, 2026 05:063,71739,024,04029,770,0001,083,0002,113,536
7Aug 28, 2026 05:063,74339,371,83529,894,0001,177,0002,113,536
8Aug 28, 2026 05:063,80939,888,54830,522,0001,093,0002,113,536
9Aug 28, 2026 05:063,88840,630,53331,167,0001,106,0002,113,536