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 18:15Josu San MartinJosu San MartinScore: 9,804Success
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 18:159,76290,391,79975,733,0005,296,0002,113,536
2Jul 3, 2026 18:159,77290,428,22675,805,0005,310,0002,113,536
3Jul 3, 2026 18:159,78690,574,54175,950,0005,282,0002,113,536
4Jul 3, 2026 18:159,79990,665,24575,960,0005,373,0002,113,536
5Jul 3, 2026 18:159,80491,030,25675,996,0005,385,0002,113,536
6Jul 3, 2026 18:159,82690,960,62476,155,0005,407,0002,113,536
7Jul 3, 2026 18:159,82890,964,44376,174,0005,402,0002,113,536
8Jul 3, 2026 18:159,83791,052,54376,168,0005,485,0002,113,536
9Jul 3, 2026 18:159,85091,153,81676,329,0005,427,0002,113,536