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 17:39Victor MerckléVictor MerckléScore: 3,907Success
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 17:403,87440,569,40531,044,0001,118,0002,117,632stderr
2Aug 11, 2026 17:403,88940,709,93331,240,0001,039,0002,117,632stderr
3Aug 11, 2026 17:403,89640,905,89431,149,0001,188,0002,117,632stderr
4Aug 11, 2026 17:403,89744,983,63131,306,0001,047,0002,117,632stderr
5Aug 11, 2026 17:403,90740,812,95131,412,0001,024,0002,117,632stderr
6Aug 11, 2026 17:403,91940,904,76731,491,0001,044,0002,117,632stderr
7Aug 11, 2026 17:403,93241,918,36831,562,0001,080,0002,117,632stderr
8Aug 11, 2026 17:403,94141,146,25731,462,0001,253,0002,117,632stderr
9Aug 11, 2026 17:403,99341,507,97631,994,0001,155,0002,117,632stderr