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 00:10Josu San MartinJosu San MartinScore: 7,108Success
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 00:107,066120,891,79150,007,0008,649,0002,113,536
2Jul 4, 2026 00:107,070120,490,79550,103,0008,581,0002,113,536
3Jul 4, 2026 00:107,107120,859,24550,378,0008,618,0002,113,536
4Jul 4, 2026 00:107,107120,900,89850,129,0008,863,0002,113,536
5Jul 4, 2026 00:107,108120,784,83450,108,0008,894,0002,113,536
6Jul 4, 2026 00:107,108120,798,47250,531,0008,470,0002,113,536
7Jul 4, 2026 00:107,148121,210,66250,699,0008,631,0002,113,536
8Jul 4, 2026 00:107,153121,299,80550,800,0008,576,0002,113,536
9Jul 4, 2026 00:107,338122,883,90352,383,0008,526,0002,113,536