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 16, 2026 18:36marko1597marko1597Score: 4,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 18:404,55546,142,17236,779,0001,030,0002,117,632
2Aug 16, 2026 18:404,56146,227,54736,830,0001,034,0002,117,632
3Aug 16, 2026 18:404,56246,207,55236,841,0001,026,0002,117,632
4Aug 16, 2026 18:404,57646,225,42136,953,0001,034,0002,117,632
5Aug 16, 2026 18:404,58446,429,15237,014,0001,034,0002,117,632
6Aug 16, 2026 18:404,58846,449,83537,042,0001,043,0002,117,632
7Aug 16, 2026 18:404,60546,618,75537,185,0001,044,0002,117,632
8Aug 16, 2026 18:404,61246,641,83737,170,0001,115,0002,117,632
9Aug 16, 2026 18:404,62246,886,89437,253,0001,114,0002,117,632