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 listDec 12, 2024 18:01Yuriy LyfenkoYuriy LyfenkoScore: 7,028Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2024 18:016,92078,062,96254,415,0003,023,0002,293,760
2Dec 12, 2024 18:017,00284,702,73952,102,0006,011,0002,510,848
3Dec 12, 2024 18:017,00884,573,98156,160,0002,005,0002,502,656
4Dec 12, 2024 18:017,02883,354,98255,319,0003,017,0002,531,328
5Dec 12, 2024 18:017,05183,534,61955,494,0003,026,0002,416,640
6Dec 12, 2024 18:017,13783,609,71356,228,0003,012,0002,514,944