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 6, 2026 11:01Kevin HeaveyKevin HeaveyScore: 3,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 11:023,50939,760,60527,910,0001,219,0002,113,536
2Sep 6, 2026 11:023,52339,350,28328,034,0001,210,0002,113,536
3Sep 6, 2026 11:023,52937,568,92728,105,0001,187,0002,113,536
4Sep 6, 2026 11:023,53337,725,96928,308,0001,022,0002,113,536
5Sep 6, 2026 11:023,54239,346,59328,316,0001,089,0002,113,536
6Sep 6, 2026 11:023,56240,411,59628,526,0001,043,0002,113,536
7Sep 6, 2026 11:023,56338,126,34928,541,0001,036,0002,113,536
8Sep 6, 2026 11:023,62841,163,22529,066,0001,054,0002,113,536
9Sep 6, 2026 11:023,82942,740,09430,579,0001,204,0002,113,536