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 27, 2024 01:02Joad NacerJoad NacerScore: 14,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 01:0214,457180,270,335119,996,93202,285,568
2Apr 27, 2024 01:0214,658192,486,167121,665,19902,289,664
3Apr 27, 2024 01:0214,954186,672,428124,120,62602,277,376