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 listMay 6, 2021 21:42Yuriy LyfenkoYuriy LyfenkoScore: 19,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2021 21:4219,397185,570,336159,996,000999,0002,260,992
2May 6, 2021 21:4219,399184,717,275160,015,0001,000,0002,260,992
3May 6, 2021 21:4219,401188,994,339158,025,0003,000,0002,387,968
4May 6, 2021 21:4219,417185,930,143159,163,0002,002,0002,260,992
5May 6, 2021 21:4219,418186,944,986160,170,0001,001,0002,260,992
6May 6, 2021 21:4219,418193,411,963160,170,0001,001,0002,260,992
7May 6, 2021 21:4219,448188,405,316161,421,00002,260,992
8May 6, 2021 21:4219,575182,744,330161,471,0001,002,0002,260,992
9May 6, 2021 21:4219,583188,483,384161,544,000997,0002,383,872