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 listMay 9, 2025 01:51nnScore: 124,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2025 01:51124,5001,061,251,8251,032,353,000999,0002,285,568
2May 9, 2025 01:51124,6201,060,934,2511,033,350,000999,0002,285,568
3May 9, 2025 01:51124,6231,065,233,7931,034,372,00002,285,568
4May 9, 2025 01:51124,6651,059,724,4971,032,719,0001,999,0002,371,584
5May 9, 2025 01:51124,6801,063,175,5431,034,840,00002,281,472
6May 9, 2025 01:51124,7051,062,147,1451,034,048,0001,000,0002,281,472
7May 9, 2025 01:51124,7551,061,747,7351,034,464,000999,0002,285,568
8May 9, 2025 01:51125,1751,063,563,1491,038,955,00002,285,568
9May 9, 2025 01:51125,2401,064,051,6571,037,497,0001,999,0002,355,200