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 18, 2024 20:37ttttError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2024 20:4500000Error: No answer to stdout. Died or killed?
2Feb 18, 2024 20:37227,5931,949,645,9931,889,018,58402,273,280
3Feb 18, 2024 20:37227,7641,951,109,5641,890,438,41802,281,472
4Feb 18, 2024 20:37228,7221,956,301,2871,898,393,72202,273,280