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 6, 2021 21:43Yuriy LyfenkoYuriy LyfenkoScore: 17,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2021 21:4317,232672,738,406141,025,0002,000,0002,523,136
2Jun 6, 2021 21:4317,233670,475,170141,031,0002,000,0002,260,992
3Jun 6, 2021 21:4317,234668,946,139141,045,0002,000,0002,387,968
4Jun 6, 2021 21:4317,236673,498,865142,058,0001,000,0002,260,992
5Jun 6, 2021 21:4317,237667,626,521142,067,0001,000,0002,260,992
6Jun 6, 2021 21:4317,241665,141,828142,104,0001,000,0002,506,752
7Jun 6, 2021 21:4317,250669,296,241143,176,00002,523,136
8Jun 6, 2021 21:4317,253669,279,241143,197,00002,260,992
9Jun 6, 2021 21:4317,255671,087,406143,217,00002,260,992
10Jun 6, 2021 21:4317,813737,973,264147,851,71502,244,608
11Jun 6, 2021 21:4317,819701,077,757147,901,23602,240,512
12Jun 6, 2021 21:4317,829705,900,866147,984,14202,277,376