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 listJul 19, 2022 11:23JesperJesperScore: 229,075Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2022 11:25229,0031,959,278,6351,900,728,05402,220,032
2Jul 19, 2022 11:25229,0361,956,946,3981,901,000,14802,224,128
3Jul 19, 2022 11:23229,0621,960,864,7391,901,211,77502,236,416
4Jul 19, 2022 11:23229,0751,960,692,6571,901,320,82902,220,032
5Jul 19, 2022 11:23229,0901,969,671,5551,901,444,16702,220,032
6Jul 19, 2022 11:25229,1341,963,165,5691,901,808,79402,224,128