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:24Kevin HeaveyKevin HeaveyScore: 3,540Success
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:263,51238,922,88128,109,0001,046,0002,113,536
2Sep 6, 2026 10:263,51639,055,92128,140,0001,045,0002,113,536
3Sep 6, 2026 10:263,52337,619,51728,212,0001,035,0002,113,536
4Sep 6, 2026 10:263,52939,432,74828,207,0001,086,0002,113,536
5Sep 6, 2026 10:263,54039,730,75928,354,0001,032,0002,113,536
6Sep 6, 2026 10:263,54837,798,37428,208,0001,248,0002,113,536
7Sep 6, 2026 10:263,55738,081,81728,288,0001,240,0002,113,536
8Sep 6, 2026 10:263,63942,309,45829,167,0001,039,0002,113,536
9Sep 6, 2026 10:263,64138,532,76829,024,0001,203,0002,113,536