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 23, 2025 22:01Dmitry YudakovDmitry YudakovScore: 191,304Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 22:01191,2431,613,368,8511,518,348,00068,970,0002,293,760
2Apr 23, 2025 22:07191,2891,614,211,5301,519,753,00067,944,0002,531,328
3Apr 23, 2025 22:01191,3041,609,655,2621,511,833,00075,991,0002,293,760
4Apr 23, 2025 22:07191,3041,616,765,6301,506,833,00080,991,0002,535,424
5Apr 23, 2025 22:01194,5161,646,068,8501,548,505,00065,978,0002,285,568
6Apr 23, 2025 22:07194,5391,634,315,0601,536,686,00077,984,0002,293,760