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 10:55Kevin HeaveyKevin HeaveyScore: 3,738Success
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 10:573,53140,933,58028,106,0001,205,0002,113,536
2Sep 6, 2026 10:573,54338,829,45128,341,0001,066,0002,113,536
3Sep 6, 2026 10:573,55039,996,07328,434,0001,036,0002,113,536
4Sep 6, 2026 10:573,65340,220,58029,262,0001,059,0002,113,536
5Sep 6, 2026 10:573,73839,342,90829,999,0001,032,0002,113,536
6Sep 6, 2026 10:573,77241,863,08530,258,0001,054,0002,113,536
7Sep 6, 2026 10:573,78342,724,19330,372,0001,032,0002,113,536
8Sep 6, 2026 10:573,79339,828,66730,289,0001,197,0002,113,536
9Sep 6, 2026 10:573,81944,467,48530,512,0001,193,0002,113,536