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 16:04Victor MerckléVictor MerckléScore: 3,858Success
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 16:043,82940,855,83330,657,0001,130,0002,117,632stderr
2Aug 29, 2026 16:043,83040,849,52930,665,0001,128,0002,117,632stderr
3Aug 29, 2026 16:043,85041,561,59730,846,0001,111,0002,117,632stderr
4Aug 29, 2026 16:043,85240,346,25630,844,0001,133,0002,117,632stderr
5Aug 29, 2026 16:043,85840,426,36130,906,0001,118,0002,117,632stderr
6Aug 29, 2026 16:043,86640,529,31030,931,0001,158,0002,117,632stderr
7Aug 29, 2026 16:044,02542,875,21932,128,0001,285,0002,117,632stderr
8Aug 29, 2026 16:044,04041,901,47532,478,0001,055,0002,117,632stderr
9Aug 29, 2026 16:044,05041,944,17732,572,0001,043,0002,117,632stderr