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 listJun 28, 2021 17:08Yuriy LyfenkoYuriy LyfenkoScore: 13,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2021 17:0813,394385,213,324111,170,00002,260,992
2Jun 28, 2021 17:0813,398385,144,844111,206,00002,523,136
3Jun 28, 2021 17:0813,401388,757,348110,224,0001,002,0002,260,992
4Jun 28, 2021 17:0813,407388,707,654111,274,00002,260,992
5Jun 28, 2021 17:0813,408386,955,620110,290,000993,0002,260,992
6Jun 28, 2021 17:0813,414395,292,195111,335,00002,527,232
7Jun 28, 2021 17:0813,414386,231,540111,334,00002,260,992
8Jun 28, 2021 17:0813,416385,845,218111,356,00002,260,992
9Jun 28, 2021 17:0813,428386,875,925110,448,0001,004,0002,260,992
10Jun 28, 2021 17:0813,566425,724,574112,597,77502,240,512
11Jun 28, 2021 17:0813,608427,444,168112,947,84202,269,184
12Jun 28, 2021 17:0813,611441,770,400112,972,29302,269,184