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 listMay 9, 2025 05:36rogue *rogue *Score: 68,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2025 05:3767,982584,967,360508,228,00056,025,0002,273,280
2May 9, 2025 05:3868,063586,507,643506,933,00057,992,0002,260,992
3May 9, 2025 05:3768,186586,904,258502,947,00062,993,0002,273,280
4May 9, 2025 05:3868,189587,863,184508,975,00056,997,0002,506,752
5May 9, 2025 05:3868,212587,954,945508,141,00058,016,0002,506,752
6May 9, 2025 05:3768,381599,076,260509,607,00057,955,0002,269,184
7May 9, 2025 05:36103,387877,156,951670,087,000188,024,0002,273,280
8May 9, 2025 05:36104,085891,929,631649,928,000213,976,0002,269,184
9May 9, 2025 05:36104,711895,478,156688,083,000181,022,0002,273,280