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 29, 2026 11:41Victor MerckléVictor MerckléScore: 4,433Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 11:444,39345,360,28035,309,0001,154,0002,117,632stderr
2Aug 29, 2026 11:444,40644,660,36335,422,0001,148,0002,117,632stderr
3Aug 29, 2026 11:444,42844,878,79535,694,0001,066,0002,117,632stderr
4Aug 29, 2026 11:444,43045,160,72935,714,0001,061,0002,117,632stderr
5Aug 29, 2026 11:444,43345,130,74935,634,0001,160,0002,117,632stderr
6Aug 29, 2026 11:444,43544,931,01335,760,0001,058,0002,117,632stderr
7Aug 29, 2026 11:444,46153,782,76435,962,0001,071,0002,117,632stderr
8Aug 29, 2026 11:444,51445,583,46236,424,0001,047,0002,117,632stderr
9Aug 29, 2026 11:444,68947,123,90037,867,0001,055,0002,117,632stderr