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 01:45Victor MerckléVictor MerckléScore: 8,856Success
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 01:458,77281,175,20071,787,0001,025,0002,117,632stderr
2Aug 27, 2026 01:458,79582,026,90371,980,0001,019,0002,117,632stderr
3Aug 27, 2026 01:458,80582,136,75671,953,0001,135,0002,117,632stderr
4Aug 27, 2026 01:458,84081,710,63272,342,0001,033,0002,117,632stderr
5Aug 27, 2026 01:458,85681,885,58172,484,0001,022,0002,117,632stderr
6Aug 27, 2026 01:458,87081,968,68972,600,0001,024,0002,117,632stderr
7Aug 27, 2026 01:458,87682,765,28272,660,0001,018,0002,117,632stderr
8Aug 27, 2026 01:458,90282,208,38972,881,0001,007,0002,117,632stderr
9Aug 27, 2026 01:458,92983,157,74073,103,0001,013,0002,117,632stderr