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 25, 2024 22:25Joad NacerJoad NacerScore: 35,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2024 22:2535,191358,933,638292,082,21802,285,568
2Apr 25, 2024 22:2535,227363,928,301292,382,93402,293,760
3Apr 25, 2024 22:2535,242353,819,427292,505,90302,281,472