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 4, 2026 10:04limanjun99limanjun99Score: 4,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 4, 2026 10:044,68356,607,88136,602,0002,267,0002,506,752
2May 4, 2026 10:044,70857,531,94736,799,0002,285,0002,510,848
3May 4, 2026 10:044,71057,447,57535,755,0003,340,0002,490,368
4May 4, 2026 10:044,71154,988,78135,806,0003,297,0002,498,560
5May 4, 2026 10:044,71157,310,52235,785,0003,317,0002,502,656
6May 4, 2026 10:044,72557,257,22235,969,0003,255,0002,498,560
7May 4, 2026 10:044,74755,406,50836,021,0003,385,0002,494,464
8May 4, 2026 10:044,76455,920,07936,284,0003,265,0002,510,848
9May 4, 2026 10:045,00858,190,78739,300,0002,274,0002,506,752