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 listApr 11, 2026 15:12Josu San MartinJosu San MartinScore: 7,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 11, 2026 15:105,00360,216,44640,510,0001,012,0002,502,656
2Apr 11, 2026 15:115,03468,254,32139,792,0001,989,0002,285,568
3Apr 11, 2026 15:105,08660,339,96041,205,0001,005,0002,285,568
4Apr 11, 2026 15:115,11766,325,68041,463,0001,011,0002,412,544
5Apr 11, 2026 15:105,30570,329,70042,034,0002,001,0002,400,256
6Apr 11, 2026 15:115,32665,092,70942,195,0002,009,0002,486,272
7Apr 11, 2026 15:117,39686,373,09058,368,0003,019,0002,486,272
8Apr 11, 2026 15:117,44289,842,41957,785,0003,985,0002,494,464
9Apr 11, 2026 15:117,49788,152,84560,215,0002,007,0002,351,104
10Apr 11, 2026 15:129,671104,542,24579,266,0001,003,0002,285,568
11Apr 11, 2026 15:129,69598,853,53679,467,0001,005,0002,285,568
12Apr 11, 2026 15:129,765103,749,91179,048,0002,001,0002,400,256