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 29, 2021 14:38Igor ShekalevIgor ShekalevScore: 68,008Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2021 14:5667,999627,357,680564,394,30002,224,128
2Jun 29, 2021 14:3868,003617,159,501564,421,11902,220,032
3Jun 29, 2021 14:5668,004620,716,087564,431,25802,215,936
4Jun 29, 2021 14:3668,006625,576,352564,449,50302,224,128
5Jun 29, 2021 14:3668,008626,264,404564,469,30502,224,128
6Jun 29, 2021 14:5668,009630,503,275564,476,94902,215,936
7Jun 29, 2021 14:3868,011631,476,181564,493,36702,224,128
8Jun 29, 2021 14:3668,015628,533,135564,522,03402,224,128
9Jun 29, 2021 14:3868,021623,367,559564,570,92302,215,936