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 listFeb 11, 2024 03:28YOM85tvE/1vsYOM85tvE/1vsScore: 120,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2024 03:28120,3601,067,225,568998,984,73202,236,416
2Feb 11, 2024 03:28120,4011,069,080,693999,324,53302,236,416
3Feb 11, 2024 03:28120,4591,059,758,878999,811,72002,236,416