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 listJun 27, 2026 02:12Code HintsCode HintsScore: 7,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 02:127,18567,150,52456,480,0003,157,0002,113,536
2Jun 27, 2026 02:127,18667,333,64156,403,0003,242,0002,113,536
3Jun 27, 2026 02:127,20767,587,89756,560,0003,265,0002,113,536
4Jun 27, 2026 02:127,20867,493,96757,799,0002,035,0002,113,536
5Jun 27, 2026 02:127,21867,491,34056,771,0003,145,0002,113,536
6Jun 27, 2026 02:127,22067,673,38756,773,0003,154,0002,113,536
7Jun 27, 2026 02:127,22567,475,19356,846,0003,125,0002,113,536
8Jun 27, 2026 02:127,23967,618,42656,932,0003,158,0002,113,536
9Jun 27, 2026 02:127,24467,637,47156,976,0003,153,0002,113,536