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 2, 2021 21:07Yuriy LyfenkoYuriy LyfenkoScore: 13,221Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2021 21:0713,181386,010,879107,410,0001,989,0002,260,992
2Jul 2, 2021 21:0713,189391,503,091108,467,0001,004,0002,260,992
3Jul 2, 2021 21:0713,199388,683,261108,548,0001,005,0002,260,992
4Jul 2, 2021 21:0713,212388,182,342107,669,0001,993,0002,260,992
5Jul 2, 2021 21:0713,213390,069,038108,668,000996,0002,260,992
6Jul 2, 2021 21:0713,214383,795,241107,684,0001,994,0002,523,136
7Jul 2, 2021 21:0713,221384,318,867107,739,0001,995,0002,260,992
8Jul 2, 2021 21:0713,222392,676,096107,748,0001,995,0002,392,064
9Jul 2, 2021 21:0713,234386,054,332108,841,000998,0002,260,992
10Jul 2, 2021 21:0713,490416,051,585111,963,62402,244,608
11Jul 2, 2021 21:0713,490411,384,642111,970,92102,244,608
12Jul 2, 2021 21:0713,499421,753,015112,041,68702,269,184