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 8, 2025 14:39Aleksey ShvetsAleksey ShvetsScore: 92,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 8, 2025 14:3992,667794,790,217768,140,0001,000,0002,531,328
2May 8, 2025 14:3992,683799,484,041768,272,0001,000,0002,334,720
3May 8, 2025 14:3992,689798,904,038768,315,0001,000,0002,338,816
4May 8, 2025 14:3992,710794,815,701767,491,0001,998,0002,531,328
5May 8, 2025 14:3992,711800,514,220768,499,000999,0002,334,720
6May 8, 2025 14:3992,711797,633,053768,504,000999,0002,281,472
7May 8, 2025 14:3992,714799,528,551766,527,0002,998,0002,334,720
8May 8, 2025 14:3992,716796,858,383766,546,0002,998,0002,277,376
9May 8, 2025 14:3992,725793,316,218767,621,0001,999,0002,334,720