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 05:58evgenikwtevgenikwtScore: 28,912Success
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 05:5828,749291,120,696238,619,42902,260,992
2Jun 12, 2021 05:5828,773315,104,093238,815,61602,260,992
3Jun 12, 2021 05:5828,791296,722,100238,969,29402,256,896
4Jun 12, 2021 05:5828,863267,254,689237,567,0001,996,0002,260,992
5Jun 12, 2021 05:5828,887260,930,098237,762,0001,998,0002,260,992
6Jun 12, 2021 05:5828,890264,186,943237,786,0001,998,0002,383,872
7Jun 12, 2021 05:5828,912263,308,005238,969,000999,0002,375,680
8Jun 12, 2021 05:5828,923274,913,574239,059,0001,000,0002,260,992
9Jun 12, 2021 05:5828,950262,492,000240,282,00002,256,896
10Jun 12, 2021 05:5828,989267,039,177239,609,000998,0002,256,896
11Jun 12, 2021 05:5829,010270,123,888238,782,0001,998,0002,379,776
12Jun 12, 2021 05:5829,019272,056,963240,860,00002,519,040