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 12, 2026 01:57Victor MerckléVictor MerckléScore: 3,868Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 01:583,84440,335,10430,773,0001,138,0002,117,632stderr
2Aug 12, 2026 01:583,85140,377,71830,887,0001,079,0002,117,632stderr
3Aug 12, 2026 01:583,85840,512,16930,907,0001,122,0002,117,632stderr
4Aug 12, 2026 01:583,86540,545,25630,939,0001,141,0002,117,632stderr
5Aug 12, 2026 01:583,86840,444,42131,043,0001,068,0002,117,632stderr
6Aug 12, 2026 01:583,87440,482,56031,074,0001,087,0002,117,632stderr
7Aug 12, 2026 01:583,90240,815,33131,306,0001,087,0002,117,632stderr
8Aug 12, 2026 01:584,17243,032,71133,568,0001,061,0002,117,632stderr
9Aug 12, 2026 01:584,29844,068,57134,462,0001,212,0002,117,632stderr