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 listSep 27, 2025 07:17sheryllynn24sheryllynn24Score: 6,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 07:176,24276,932,30549,813,0001,992,0002,289,664
2Sep 27, 2025 07:176,24278,594,86949,820,0001,992,0002,523,136
3Sep 27, 2025 07:176,24377,756,56450,820,000996,0002,289,664
4Sep 27, 2025 07:176,24382,854,68849,823,0001,992,0002,281,472
5Sep 27, 2025 07:176,24476,488,00550,826,000996,0002,527,232
6Sep 27, 2025 07:176,25278,894,80449,895,0001,995,0002,289,664
7Sep 27, 2025 07:176,25376,343,03349,900,0001,996,0002,289,664
8Sep 27, 2025 07:176,26477,461,44149,991,0001,999,0002,527,232
9Sep 27, 2025 07:176,36081,102,01150,799,0001,992,0002,289,664
10Sep 27, 2025 07:176,36181,737,56150,806,0001,992,0002,289,664
11Sep 27, 2025 07:176,36881,608,15352,854,00002,289,664
12Sep 27, 2025 07:177,40482,398,11361,456,00002,527,232