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 listMay 10, 2026 09:10Josu San MartinJosu San MartinScore: 4,603Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 09:114,57754,065,41836,847,0001,145,0002,486,272
2May 10, 2026 09:114,58754,066,02837,030,0001,050,0002,478,080
3May 10, 2026 09:114,59153,883,35937,074,0001,036,0002,498,560
4May 10, 2026 09:114,59351,965,41937,065,0001,061,0002,494,464
5May 10, 2026 09:114,60353,729,59537,167,0001,045,0002,486,272
6May 10, 2026 09:114,60355,073,85437,156,0001,051,0002,486,272
7May 10, 2026 09:114,63853,472,63737,441,0001,060,0002,482,176
8May 10, 2026 09:114,64654,960,52037,494,0001,076,0002,482,176
9May 10, 2026 09:114,70156,243,25037,966,0001,057,0002,473,984