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 4, 2026 01:17Josu San MartinJosu San MartinScore: 5,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 01:175,64656,304,67143,488,0003,379,0002,113,536
2Jul 4, 2026 01:175,65956,452,33143,485,0003,485,0002,113,536
3Jul 4, 2026 01:175,67356,451,44543,682,0003,406,0002,113,536
4Jul 4, 2026 01:175,70156,749,92043,956,0003,370,0002,113,536
5Jul 4, 2026 01:175,72556,936,49044,185,0003,333,0002,113,536
6Jul 4, 2026 01:175,73756,942,82944,215,0003,407,0002,113,536
7Jul 4, 2026 01:175,76757,204,05744,398,0003,472,0002,113,536
8Jul 4, 2026 01:175,83757,841,11745,110,0003,340,0002,113,536
9Jul 4, 2026 01:176,14360,418,61547,545,0003,450,0002,113,536