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 listFeb 21, 2026 22:05MathSOMathSOScore: 207,744Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 22:05207,5201,748,236,3801,630,449,00091,968,0002,330,624
2Feb 21, 2026 22:05207,5781,751,881,3701,615,901,000106,993,0002,396,160
3Feb 21, 2026 22:05207,7391,744,353,9981,632,276,00091,959,0002,330,624
4Feb 21, 2026 22:05207,7431,749,486,4721,631,308,00092,960,0002,330,624
5Feb 21, 2026 22:05207,7441,755,754,4451,641,312,00082,965,0002,318,336
6Feb 21, 2026 22:05207,8421,752,427,7961,625,138,00099,947,0002,318,336
7Feb 21, 2026 22:05207,8811,749,339,9601,633,441,00091,968,0002,383,872
8Feb 21, 2026 22:05207,9691,746,363,3701,635,187,00090,954,0002,318,336
9Feb 21, 2026 22:05208,0561,751,792,9861,636,927,00089,941,0002,318,336