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,425Success
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:495,31355,245,62942,937,0001,164,0002,113,536
2Aug 16, 2026 13:495,39054,793,04343,580,0001,157,0002,113,536
3Aug 16, 2026 13:495,42055,774,21943,841,0001,151,0002,113,536
4Aug 16, 2026 13:495,42155,031,39643,857,0001,143,0002,113,536
5Aug 16, 2026 13:495,42555,026,25743,890,0001,141,0002,113,536
6Aug 16, 2026 13:495,43055,955,95643,918,0001,156,0002,113,536
7Aug 16, 2026 13:495,43555,310,61443,942,0001,175,0002,113,536
8Aug 16, 2026 13:495,45156,024,14344,195,0001,050,0002,113,536
9Aug 16, 2026 13:495,62957,902,23245,583,0001,143,0002,113,536