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 listDec 9, 2024 13:53virusegvirusegScore: 373,090Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2024 13:53372,6563,119,956,1282,982,112,000110,929,0002,502,656
2Dec 9, 2024 13:53372,8543,130,055,1212,965,789,000128,903,0002,437,120
3Dec 9, 2024 13:53373,0533,124,913,6112,980,437,000115,900,0002,351,104
4Dec 9, 2024 13:53373,0583,124,487,3572,998,468,00097,917,0002,482,176
5Dec 9, 2024 13:53373,0903,124,745,8962,994,722,000101,922,0002,457,600
6Dec 9, 2024 13:53374,6323,137,855,2572,997,538,000111,908,0002,351,104
7Dec 9, 2024 13:53374,9113,139,851,1492,995,845,000115,916,0002,498,560
8Dec 9, 2024 13:53375,1973,145,675,1262,994,247,000119,889,0002,396,160
9Dec 9, 2024 13:53375,5293,143,802,6203,009,962,000106,927,0002,351,104