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 listJun 5, 2024 11:03matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2024 11:0300000Error: expected "53687508448496802 ", got "1001 0000 0000 0100 0000 0001 0000 0000 13532760 1000 0010 0000 0010 0000 0001 0000 0000 15215574 0100 0100 0000 1000 0000 0001 0000 0000 42880583 1000 0000 0010 0010 0000 0100 0000 0000 42880584 1000 0000 000...stderr
2Jun 5, 2024 11:0400000Error: expected "53691999748783018 ", got "0100 0100 0000 1000 0000 0001 0000 0000 26198503 1000 0000 0010 0010 0000 0100 0000 0000 26198504 1000 0000 0001 0000 0000 0100 0100 0000 26198505 0101 0000 0000 0100 0000 0010 0000 0000 36868935 1000 0000 000...stderr
3Jun 5, 2024 11:0500000Error: expected "53692990755405752 ", got "0100 0100 0000 1000 0000 0001 0000 0000 22353913 1000 0000 0010 0010 0000 0100 0000 0000 22353914 1000 0000 0001 0000 0000 0100 0100 0000 22353915 0101 0000 0000 0100 0000 0010 0000 0000 33024345 1000 0000 000...stderr