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 10:54Victor MerckléVictor MerckléScore: 12,609Success
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 10:5512,587112,854,480103,444,0001,031,0002,117,632stderr
2Aug 25, 2026 10:5512,601112,923,568103,551,0001,042,0002,117,632stderr
3Aug 25, 2026 10:5512,606112,927,463103,591,0001,047,0002,117,632stderr
4Aug 25, 2026 10:5512,608113,064,003103,568,0001,081,0002,117,632stderr
5Aug 25, 2026 10:5512,609113,079,222103,640,0001,019,0002,117,632stderr
6Aug 25, 2026 10:5512,610113,036,734103,600,0001,066,0002,117,632stderr
7Aug 25, 2026 10:5512,615113,162,708103,687,0001,020,0002,117,632stderr
8Aug 25, 2026 10:5512,837114,974,275105,529,0001,024,0002,117,632stderr
9Aug 25, 2026 10:5512,837114,905,599105,512,0001,037,0002,117,632stderr