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 listJul 21, 2026 21:43Kevin HeaveyKevin HeaveyScore: 3,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2026 21:453,55442,048,09328,392,0001,109,0002,113,536
2Jul 21, 2026 21:453,56239,162,91028,395,0001,170,0002,113,536
3Jul 21, 2026 21:453,58839,457,70128,590,0001,194,0002,113,536
4Jul 21, 2026 21:453,66443,992,31929,221,0001,193,0002,113,536
5Jul 21, 2026 21:453,73740,706,02829,852,0001,173,0002,113,536
6Jul 21, 2026 21:453,81541,848,78230,489,0001,180,0002,113,536
7Jul 21, 2026 21:453,83342,032,99630,771,0001,045,0002,113,536
8Jul 21, 2026 21:453,84842,126,88830,782,0001,164,0002,113,536
9Jul 21, 2026 21:453,87942,407,49431,018,0001,180,0002,113,536