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 9, 2026 21:59Josu San MartinJosu San MartinScore: 5,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 21:595,07058,592,34941,057,0001,025,0002,342,912
2May 9, 2026 21:595,08958,198,09141,204,0001,038,0002,347,008
3May 9, 2026 21:595,11459,421,17841,407,0001,042,0002,342,912
4May 9, 2026 21:595,11559,871,94141,251,0001,206,0002,342,912
5May 9, 2026 21:595,19659,587,46841,830,0001,303,0002,338,816
6May 9, 2026 21:595,19757,319,98241,851,0001,288,0002,347,008
7May 9, 2026 21:595,21958,045,76742,300,0001,023,0002,342,912
8May 9, 2026 21:595,22358,807,57042,057,0001,297,0002,359,296
9May 9, 2026 21:595,25960,777,86842,619,0001,033,0002,338,816