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 09:30E 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 09:3000000Error: Exit with code 1: 9 9 23 Contents of __m256i: 7 3 3 6 2 7 4 8 8 218 4 9 3 6 2 3 0 7 6 218 1 3 5 3 7 5 9 5 9 1 218 4 Contents of __m256i: 0 0 0 0 0 0 0 7 3 3 6 2 7 4 8 8 0 0 0 0 0 0 0 0 7 6 218 1 3 5 3 7 Contents of __m256i: 0 0 0 0 0 0 7 0 33 ...stderr
2Apr 7, 2024 09:3200000Error: Exit with code 1: 9 9 23 Contents of __m256i: 3 9 5 3 4 1 5 8 8 218 1 5 7 6 7 1 4 4 0 6 218 9 5 5 7 5 5 8 0 9 218 8 Contents of __m256i: 0 0 0 0 0 0 0 3 9 5 3 4 1 5 8 8 0 0 0 0 0 0 0 4 4 0 6 218 9 5 5 7 Contents of __m256i: 0 0 0 0 0 0 3 0 95 ...stderr