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 listFeb 9, 2026 16:45lipapipalipapipaScore: 10,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 16:4510,271110,174,53982,244,0003,008,0002,392,064
2Feb 9, 2026 16:4510,456111,613,97885,790,000997,0002,400,256
3Feb 9, 2026 16:4510,468116,840,48883,891,0002,996,0002,396,160
4Feb 9, 2026 16:4510,500113,896,38683,140,0004,006,0002,494,464
5Feb 9, 2026 16:4510,525109,741,20685,351,0002,008,0002,367,488
6Feb 9, 2026 16:4510,577112,145,76286,792,000997,0002,396,160
7Feb 9, 2026 16:4510,586116,986,62685,844,0002,019,0002,277,376
8Feb 9, 2026 16:4510,616113,443,27984,109,0004,005,0002,392,064
9Feb 9, 2026 16:4510,760116,083,12086,299,0003,010,0002,506,752
10Feb 9, 2026 16:4510,794116,978,34186,569,0003,019,0002,269,184
11Feb 9, 2026 16:4510,822114,097,16287,827,0001,996,0002,400,256
12Feb 9, 2026 16:4511,027113,631,64490,523,0001,005,0002,392,064