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 2, 2024 14:05Yuriy LyfenkoYuriy LyfenkoScore: 7,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2024 14:057,02178,017,12155,261,0003,014,0002,510,848
2Sep 2, 2024 14:057,03581,291,36254,362,0004,026,0002,498,560
3Sep 2, 2024 14:057,06883,282,61354,622,0004,046,0002,514,944
4Sep 2, 2024 14:057,10883,348,47855,994,0002,999,0002,310,144
5Sep 2, 2024 14:057,11983,520,14054,083,0005,007,0002,310,144
6Sep 2, 2024 14:057,14782,660,67156,308,0003,016,0002,359,296
7Sep 2, 2024 14:057,21782,758,55757,907,0001,996,0002,498,560
8Sep 2, 2024 14:057,25083,866,53057,167,0003,008,0002,400,256
9Sep 2, 2024 14:057,32687,477,97656,820,0003,987,0002,420,736