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 listJul 3, 2026 20:36Josu San MartinJosu San MartinScore: 8,585Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:378,53280,179,76663,971,0006,852,0002,121,728
2Jul 3, 2026 20:378,53881,676,21864,000,0006,873,0002,121,728
3Jul 3, 2026 20:378,56780,441,48064,221,0006,892,0002,125,824
4Jul 3, 2026 20:378,57080,507,87564,350,0006,786,0002,117,632
5Jul 3, 2026 20:378,58580,623,24764,442,0006,815,0002,121,728
6Jul 3, 2026 20:378,59880,696,72864,683,0006,682,0002,121,728
7Jul 3, 2026 20:378,61880,949,02864,406,0007,124,0002,125,824
8Jul 3, 2026 20:378,63581,086,62064,854,0006,822,0002,117,632
9Jul 3, 2026 20:378,70981,680,31465,096,0007,195,0002,117,632