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 12, 2021 21:05evgenikwtevgenikwtScore: 28,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2021 21:0527,586287,564,598228,960,94402,244,608
2Jun 12, 2021 21:0528,005295,725,419232,445,58002,260,992
3Jun 12, 2021 21:0528,010291,536,449232,479,56702,256,896
4Jun 12, 2021 21:0528,060257,454,673230,899,0001,999,0002,260,992
5Jun 12, 2021 21:0528,103258,623,232232,250,0001,001,0002,371,584
6Jun 12, 2021 21:0528,167256,324,593233,786,00002,519,040
7Jun 12, 2021 21:0528,431266,955,348234,975,000999,0002,260,992
8Jun 12, 2021 21:0528,469264,439,662236,290,00002,260,992
9Jun 12, 2021 21:0528,585263,439,416237,252,00002,519,040
10Jun 12, 2021 21:0528,638262,280,256236,698,000998,0002,519,040
11Jun 12, 2021 21:0528,671261,525,733235,968,0001,999,0002,371,584
12Jun 12, 2021 21:0528,701271,934,151238,220,00002,523,136