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:12marko1597marko1597Score: 5,142Success
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:335,08750,651,41641,198,0001,027,0002,117,632
2Aug 16, 2026 18:335,11950,983,82141,388,0001,106,0002,117,632
3Aug 16, 2026 18:335,12450,991,96141,424,0001,113,0002,117,632
4Aug 16, 2026 18:335,14251,016,04241,568,0001,115,0002,117,632
5Aug 16, 2026 18:335,14251,095,71941,654,0001,026,0002,117,632
6Aug 16, 2026 18:336,27460,547,70651,036,0001,040,0002,117,632
7Aug 16, 2026 18:336,30360,835,29151,158,0001,162,0002,117,632
8Aug 16, 2026 18:337,13276,196,70658,021,0001,180,0002,117,632
9Aug 16, 2026 18:337,16868,683,37358,347,0001,148,0002,117,632