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 27, 2026 16:50Victor MerckléVictor MerckléScore: 4,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 16:514,16743,259,77233,422,0001,166,0002,117,632stderr
2Aug 27, 2026 16:514,16743,626,97433,470,0001,121,0002,117,632stderr
3Aug 27, 2026 16:514,17543,013,61833,484,0001,172,0002,117,632stderr
4Aug 27, 2026 16:514,17743,126,87833,539,0001,131,0002,117,632stderr
5Aug 27, 2026 16:514,18144,371,35033,573,0001,136,0002,117,632stderr
6Aug 27, 2026 16:514,22343,438,43833,990,0001,069,0002,117,632stderr
7Aug 27, 2026 16:514,25943,811,50134,301,0001,056,0002,117,632stderr
8Aug 27, 2026 16:514,30244,165,82534,586,0001,125,0002,117,632stderr
9Aug 27, 2026 16:514,56146,358,41536,790,0001,067,0002,117,632stderr