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 16, 2026 18:04KacpxerKacpxerScore: 12,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:0512,040110,383,02598,928,0001,005,0002,113,536
2Oct 16, 2026 18:0512,043110,397,58298,952,0001,011,0002,113,536
3Oct 16, 2026 18:0512,044110,526,87598,965,0001,003,0002,113,536
4Oct 16, 2026 18:0512,046110,468,69098,972,0001,013,0002,113,536
5Oct 16, 2026 18:0512,071110,626,91999,182,0001,014,0002,113,536
6Oct 16, 2026 18:0512,073110,746,22299,198,0001,012,0002,113,536
7Oct 16, 2026 18:0512,098110,861,52599,412,0001,003,0002,113,536
8Oct 16, 2026 18:0512,099112,252,85699,419,0001,009,0002,113,536
9Oct 16, 2026 18:0512,108111,064,24999,413,0001,087,0002,113,536