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 09:36Kevin HeaveyKevin HeaveyScore: 3,748Success
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 09:373,52637,720,11628,223,0001,050,0002,113,536
2Sep 6, 2026 09:373,55338,191,49128,373,0001,119,0002,113,536
3Sep 6, 2026 09:373,71239,502,55329,557,0001,258,0002,113,536
4Sep 6, 2026 09:373,73239,650,76729,937,0001,039,0002,113,536
5Sep 6, 2026 09:373,74839,625,04430,064,0001,051,0002,113,536
6Sep 6, 2026 09:373,76739,750,97530,191,0001,081,0002,113,536
7Sep 6, 2026 09:373,78840,078,99230,402,0001,045,0002,113,536
8Sep 6, 2026 09:373,82040,295,68930,675,0001,037,0002,113,536
9Sep 6, 2026 09:373,82440,345,70930,695,0001,049,0002,113,536