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 listOct 13, 2026 06:25e1011e1011Score: 58,346Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 06:2558,205494,315,765422,156,00060,953,0002,113,536
2Oct 13, 2026 06:2558,223493,878,598422,372,00060,881,0002,113,536
3Oct 13, 2026 06:2558,242494,591,400422,993,00060,418,0002,113,536
4Oct 13, 2026 06:2558,310495,240,718422,475,00061,502,0002,113,536
5Oct 13, 2026 06:2558,346495,457,490422,818,00061,458,0002,113,536
6Oct 13, 2026 06:2558,375495,358,242423,183,00061,335,0002,113,536
7Oct 13, 2026 06:2558,396495,311,236422,571,00062,122,0002,113,536
8Oct 13, 2026 06:2558,416496,311,247422,544,00062,316,0002,113,536
9Oct 13, 2026 06:2558,438495,945,496423,046,00061,994,0002,113,536