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 25, 2026 22:53Victor MerckléVictor MerckléScore: 3,775Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 22:543,74739,470,48730,087,0001,017,0002,117,632stderr
2Aug 25, 2026 22:543,76639,662,89130,186,0001,077,0002,117,632stderr
3Aug 25, 2026 22:543,77339,675,67430,310,0001,014,0002,117,632stderr
4Aug 25, 2026 22:543,77439,680,58230,231,0001,101,0002,117,632stderr
5Aug 25, 2026 22:543,77539,808,41230,260,0001,077,0002,117,632stderr
6Aug 25, 2026 22:543,77939,764,43830,333,0001,033,0002,117,632stderr
7Aug 25, 2026 22:543,80639,945,97030,493,0001,105,0002,117,632stderr
8Aug 25, 2026 22:543,88440,639,96831,213,0001,031,0002,117,632stderr
9Aug 25, 2026 22:543,95241,240,43331,775,0001,029,0002,117,632stderr