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 25, 2026 16:03Victor MerckléVictor MerckléScore: 7,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 16:037,58071,278,24660,615,0002,299,0002,117,632stderr
2Aug 25, 2026 16:037,63871,702,79161,211,0002,190,0002,117,632stderr
3Aug 25, 2026 16:037,63971,783,74261,147,0002,263,0002,117,632stderr
4Aug 25, 2026 16:037,66372,125,49861,344,0002,264,0002,117,632stderr
5Aug 25, 2026 16:037,67372,154,97761,388,0002,304,0002,117,632stderr
6Aug 25, 2026 16:037,69372,318,82761,590,0002,270,0002,117,632stderr
7Aug 25, 2026 16:037,74472,710,20662,078,0002,202,0002,117,632stderr
8Aug 25, 2026 16:037,90173,931,51763,392,0002,194,0002,117,632stderr
9Aug 25, 2026 16:038,06975,312,49964,705,0002,272,0002,117,632stderr