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 16, 2026 13:20marko1597marko1597Score: 5,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:515,30854,125,13242,914,0001,147,0002,113,536
2Aug 16, 2026 13:515,30854,077,73742,902,0001,157,0002,113,536
3Aug 16, 2026 13:515,32554,223,96243,117,0001,084,0002,113,536
4Aug 16, 2026 13:515,33454,345,42343,188,0001,090,0002,113,536
5Aug 16, 2026 13:515,40255,661,22743,686,0001,157,0002,113,536
6Aug 16, 2026 13:515,46255,377,80544,195,0001,144,0002,113,536
7Aug 16, 2026 13:515,46855,298,74444,247,0001,140,0002,113,536
8Aug 16, 2026 13:515,46855,344,17244,252,0001,134,0002,113,536
9Aug 16, 2026 13:515,57756,993,43145,124,0001,166,0002,113,536