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 listJan 7, 2026 04:07Josu San MartinJosu San MartinScore: 6,561Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 21, 2026 18:37Yuriy Lyfenko10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 04:076,44376,246,47751,463,0002,018,0002,371,584
2Jan 7, 2026 04:076,48079,924,17951,794,0001,992,0002,433,024
3Jan 7, 2026 04:076,48182,562,63551,804,0001,992,0002,428,928
4Jan 7, 2026 04:076,56174,619,30651,428,0003,025,0002,383,872
5Jan 7, 2026 04:076,65480,504,30653,222,0002,008,0002,433,024
6Jan 7, 2026 04:076,78077,473,06853,260,0003,014,0002,555,904