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 listApr 1, 2024 15:51E SequeiraE SequeiraScore: 55,190Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2024 15:5155,160517,306,775457,825,12902,293,760
2Apr 1, 2024 15:5155,168520,526,839457,890,27802,289,664
3Apr 1, 2024 15:5155,184518,951,849458,025,99902,281,472
4Apr 1, 2024 15:5155,190523,106,676458,076,38102,293,760
5Apr 1, 2024 15:5156,828527,218,719471,669,77202,285,568
6Apr 1, 2024 15:5156,852536,684,402471,874,31502,289,664