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 7, 2024 10:51E SequeiraE SequeiraError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 7, 2024 10:5100000Error: Exit with code 1: 9 9 23 Contents of __m256i: 8 2 4 3 7 2 1 8 6 218 1 5 0 8 2 9 5 4 3 1 218 1 1 9 9 7 6 2 8 4 9 218 Contents of __m256i: 0 0 0 0 0 0 0 8 2 4 3 7 2 1 8 6 0 0 0 0 0 0 0 5 4 3 1 218 1 1 9 9 Contents of __m256i: 0 0 0 0 0 0 8 0 24 ...stderr