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 3, 2023 09:33Erdem KeskinErdem KeskinScore: 83,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2023 09:3383,881760,471,770696,212,63102,236,416
2Jul 3, 2023 09:3783,886749,264,783696,256,27702,232,320
3Jul 3, 2023 09:3783,897751,956,156696,348,75202,236,416
4Jul 3, 2023 09:3783,900763,158,919696,372,91702,224,128
5Jul 3, 2023 09:3383,902763,857,055696,390,71202,240,512
6Jul 3, 2023 09:3383,934764,958,492696,652,64702,236,416