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 listDec 13, 2025 11:30pseppsepScore: 44,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 13, 2025 11:3044,910411,003,294370,751,0001,998,0002,256,896
2Dec 13, 2025 11:3044,914398,550,576371,791,000999,0002,375,680
3Dec 13, 2025 11:3044,919403,870,198370,826,0001,999,0002,383,872
4Dec 13, 2025 11:3044,921403,559,004370,848,0001,999,0002,506,752
5Dec 13, 2025 11:3044,921404,209,304370,847,0001,999,0002,506,752
6Dec 13, 2025 11:3044,922397,527,106369,856,0002,998,0002,514,944
7Dec 13, 2025 11:3044,940397,002,182370,999,0001,999,0002,375,680
8Dec 13, 2025 11:3044,946397,613,086373,051,00002,510,848
9Dec 13, 2025 11:3044,977398,794,889372,305,0001,000,0002,396,160