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 listAug 30, 2026 18:15Josu San MartinJosu San MartinScore: 4,509Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:164,47245,576,41036,092,0001,028,0002,113,536
2Aug 30, 2026 18:164,48345,791,68736,183,0001,032,0002,113,536
3Aug 30, 2026 18:164,49945,827,45436,326,0001,023,0002,113,536
4Aug 30, 2026 18:164,50745,904,85236,284,0001,127,0002,113,536
5Aug 30, 2026 18:164,50945,895,98436,304,0001,123,0002,113,536
6Aug 30, 2026 18:164,51047,039,98036,320,0001,116,0002,113,536
7Aug 30, 2026 18:164,53046,037,15036,464,0001,137,0002,113,536
8Aug 30, 2026 18:164,53846,131,25636,541,0001,131,0002,113,536
9Aug 30, 2026 18:164,73147,759,49738,153,0001,116,0002,113,536