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 listAug 30, 2026 18:58Josu San MartinJosu San MartinScore: 4,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:584,33244,407,55334,835,0001,127,0002,113,536
2Aug 30, 2026 18:584,33344,485,50334,923,0001,049,0002,113,536
3Aug 30, 2026 18:584,34544,513,15835,017,0001,053,0002,113,536
4Aug 30, 2026 18:584,35044,617,35334,995,0001,118,0002,113,536
5Aug 30, 2026 18:584,35544,651,76935,037,0001,113,0002,113,536
6Aug 30, 2026 18:584,35544,660,42035,029,0001,125,0002,113,536
7Aug 30, 2026 18:584,36244,633,06135,074,0001,131,0002,113,536
8Aug 30, 2026 18:584,36744,706,04235,119,0001,134,0002,113,536
9Aug 30, 2026 18:584,37544,761,93135,277,0001,041,0002,113,536