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 14, 2026 13:52marko1597marko1597Score: 6,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 14, 2026 13:536,34762,709,74251,543,0001,141,0002,113,536
2Aug 14, 2026 13:536,34862,764,20551,550,0001,145,0002,113,536
3Aug 14, 2026 13:536,35163,934,93551,566,0001,151,0002,113,536
4Aug 14, 2026 13:536,35162,765,09851,548,0001,170,0002,113,536
5Aug 14, 2026 13:536,35562,733,37351,600,0001,152,0002,113,536
6Aug 14, 2026 13:536,35662,734,44751,531,0001,229,0002,113,536
7Aug 14, 2026 13:536,36063,531,38851,568,0001,225,0002,113,536
8Aug 14, 2026 13:536,36462,929,72951,605,0001,221,0002,113,536
9Aug 14, 2026 13:536,43164,221,14852,123,0001,262,0002,113,536