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:40Yuriy LyfenkoYuriy LyfenkoScore: 17,482Success
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:4017,219712,658,881142,917,72302,244,608
2Jun 6, 2021 21:4017,219699,813,675142,914,71602,277,376
3Jun 6, 2021 21:4017,222699,222,622142,939,97302,244,608
4Jun 6, 2021 21:4017,473669,582,904144,028,0001,000,0002,260,992
5Jun 6, 2021 21:4017,476669,832,237145,051,00002,260,992
6Jun 6, 2021 21:4017,481667,903,130143,092,0002,001,0002,260,992
7Jun 6, 2021 21:4017,482665,687,082144,097,0001,000,0002,260,992
8Jun 6, 2021 21:4017,496675,376,480143,229,0001,989,0002,260,992
9Jun 6, 2021 21:4017,499671,562,868144,238,0001,001,0002,260,992
10Jun 6, 2021 21:4017,502674,416,091144,263,0001,001,0002,523,136
11Jun 6, 2021 21:4017,507666,280,532144,303,0001,002,0002,523,136
12Jun 6, 2021 21:4017,512674,763,512144,351,0001,002,0002,260,992