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 4, 2021 22:43Yuriy LyfenkoYuriy LyfenkoScore: 22,563Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2021 22:4321,807206,302,601178,001,0003,000,0002,392,064
2May 4, 2021 22:4322,556213,911,946185,213,0002,002,0002,506,752
3May 4, 2021 22:4322,556214,565,182186,211,0001,001,0002,392,064
4May 4, 2021 22:4322,562210,253,087187,265,00002,387,968
5May 4, 2021 22:4322,563214,260,001187,276,00002,387,968
6May 4, 2021 22:4322,574213,754,861187,363,00002,260,992
7May 4, 2021 22:4322,579213,697,568187,402,00002,260,992
8May 4, 2021 22:4322,581215,193,165186,420,0001,002,0002,392,064
9May 4, 2021 22:4322,585213,081,601185,463,0001,994,0002,510,848