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 listDec 19, 2024 12:41Javid izadiJavid izadiScore: 485,320Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2024 12:41481,0714,020,607,4743,830,974,000161,914,0002,330,624
2Dec 19, 2024 12:41485,3204,058,731,6093,844,288,000183,870,0002,523,136
3Dec 19, 2024 12:41487,3634,080,066,0183,849,204,000195,908,0002,420,736