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 19:34Victor MerckléVictor MerckléScore: 3,945Success
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 19:343,93040,783,19131,576,0001,046,0002,117,632stderr
2Aug 11, 2026 19:343,93242,119,73331,604,0001,034,0002,117,632stderr
3Aug 11, 2026 19:343,93340,751,48531,608,0001,037,0002,117,632stderr
4Aug 11, 2026 19:343,93741,389,54631,526,0001,156,0002,117,632stderr
5Aug 11, 2026 19:343,94540,922,00431,685,0001,061,0002,117,632stderr
6Aug 11, 2026 19:343,94540,907,34031,701,0001,044,0002,117,632stderr
7Aug 11, 2026 19:343,95441,145,41131,693,0001,126,0002,117,632stderr
8Aug 11, 2026 19:343,96341,074,09231,746,0001,149,0002,117,632stderr
9Aug 11, 2026 19:344,06341,857,93032,684,0001,047,0002,117,632stderr