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 1, 2021 00:17Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 1, 2021 00:1700000Error: expected "53681330893906461 ", got "53681330893650461 "
2Jul 1, 2021 00:1713,018380,112,367106,051,0002,000,0002,506,752
3Jul 1, 2021 00:1713,019385,381,006106,058,0002,001,0002,260,992
4Jul 1, 2021 00:1713,023384,979,151107,094,0001,000,0002,260,992
5Jul 1, 2021 00:1713,025383,636,294106,103,0002,001,0002,400,256
6Jul 1, 2021 00:1713,031380,915,874107,160,0001,001,0002,260,992
7Jul 1, 2021 00:1713,039388,441,588107,225,0001,002,0002,260,992
8Jul 1, 2021 00:1713,043379,716,162107,255,0001,002,0002,527,232
9Jul 1, 2021 00:1713,050379,534,118107,310,0001,002,0002,478,080
10Jul 1, 2021 00:1713,272419,049,539110,160,25202,265,088
11Jul 1, 2021 00:1713,279420,896,492110,213,92102,244,608
12Jul 1, 2021 00:1713,333413,355,684110,667,71202,260,992
13Jul 1, 2021 00:1713,390385,055,207110,135,0001,001,0002,252,800