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 listNov 18, 2024 03:19zielajzielajScore: 4,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2024 03:193,67455,261,52630,491,00002,461,696
2Nov 18, 2024 03:193,95765,609,81032,847,00002,383,872
3Nov 18, 2024 03:193,95962,500,37731,864,000995,0002,379,776
4Nov 18, 2024 03:194,17058,145,79033,595,0001,018,0002,404,352
5Nov 18, 2024 03:194,20355,879,18932,889,0001,993,0002,400,256
6Nov 18, 2024 03:194,25957,198,27034,342,0001,010,0002,269,184