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 12:22Kevin HeaveyKevin HeaveyScore: 3,538Success
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 12:243,51139,255,77328,046,0001,101,0002,113,536
2Sep 6, 2026 12:243,51339,040,66128,104,0001,059,0002,113,536
3Sep 6, 2026 12:243,51538,708,73927,973,0001,204,0002,113,536
4Sep 6, 2026 12:243,52639,434,07728,176,0001,097,0002,113,536
5Sep 6, 2026 12:243,53839,465,07228,334,0001,038,0002,113,536
6Sep 6, 2026 12:243,54037,735,72928,183,0001,206,0002,113,536
7Sep 6, 2026 12:243,54840,786,56028,414,0001,037,0002,113,536
8Sep 6, 2026 12:243,56037,878,94628,312,0001,236,0002,113,536
9Sep 6, 2026 12:243,60338,240,77828,698,0001,211,0002,113,536