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 13, 2024 03:01bgimby-nsbgimby-nsScore: 1,655,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2024 03:011,645,41313,718,372,80713,656,931,38602,256,896
2Jul 13, 2024 03:011,655,90813,810,854,72613,744,037,87502,260,992
3Jul 13, 2024 03:011,703,12814,211,963,82314,135,960,38102,265,088