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:58Yuriy LyfenkoYuriy LyfenkoScore: 13,381Success
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:5813,358391,068,295108,872,0001,997,0002,260,992
2Jun 28, 2021 17:5813,365394,798,336109,933,000999,0002,260,992
3Jun 28, 2021 17:5813,367391,937,296108,945,0001,999,0002,387,968
4Jun 28, 2021 17:5813,371391,138,955109,980,000999,0002,260,992
5Jun 28, 2021 17:5813,375384,176,333110,009,0001,000,0002,260,992
6Jun 28, 2021 17:5813,380384,120,446109,055,0002,001,0002,260,992
7Jun 28, 2021 17:5813,381385,314,042109,062,0002,001,0002,523,136
8Jun 28, 2021 17:5813,385385,993,694111,094,00002,260,992
9Jun 28, 2021 17:5813,404388,753,369110,264,000993,0002,523,136
10Jun 28, 2021 17:5813,584424,163,408112,750,47002,240,512
11Jun 28, 2021 17:5813,590429,156,935112,794,95502,269,184
12Jun 28, 2021 17:5813,595430,266,031112,838,30702,236,416