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 listSep 23, 2026 10:16Kevin HeaveyKevin HeaveyScore: 3,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 10:203,20637,071,54125,505,0001,107,0002,113,536
2Sep 23, 2026 10:203,21735,207,39525,571,0001,138,0002,113,536
3Sep 23, 2026 10:203,22235,372,23325,625,0001,122,0002,113,536
4Sep 23, 2026 10:203,23535,470,34425,659,0001,197,0002,113,536
5Sep 23, 2026 10:203,23535,468,91725,828,0001,030,0002,113,536
6Sep 23, 2026 10:203,24135,530,36825,857,0001,050,0002,113,536
7Sep 23, 2026 10:203,25235,500,78325,984,0001,014,0002,113,536
8Sep 23, 2026 10:203,25535,447,12625,966,0001,051,0002,113,536
9Sep 23, 2026 10:203,27135,682,87325,958,0001,197,0002,113,536