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 30, 2021 01:02gchebanovgchebanovScore: 12,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 30, 2021 01:0212,766132,083,212104,960,000999,0002,375,680
2Jun 30, 2021 01:0212,768135,004,039103,975,0001,999,0002,523,136
3Jun 30, 2021 01:0212,771129,875,133103,998,0001,999,0002,379,776
4Jun 30, 2021 01:0212,778134,851,516105,059,0001,000,0002,523,136
5Jun 30, 2021 01:0212,785134,177,536105,113,0001,001,0002,375,680
6Jun 30, 2021 01:0212,795131,364,448105,196,0001,001,0002,523,136
7Jun 30, 2021 01:0212,797134,239,727104,208,0002,004,0002,379,776
8Jun 30, 2021 01:0212,797133,781,068105,215,0001,002,0002,371,584
9Jun 30, 2021 01:0212,811138,035,715106,333,00002,502,656
10Jun 30, 2021 01:0213,329169,121,254110,631,93302,248,704
11Jun 30, 2021 01:0213,344187,193,300110,755,09902,260,992
12Jun 30, 2021 01:0213,657176,130,916113,357,14702,244,608