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 listNov 17, 2024 19:31Ilango RajagopalIlango RajagopalScore: 38,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2024 19:3138,140342,410,317315,565,0001,001,0002,289,664
2Nov 17, 2024 19:3138,159344,119,254314,722,0001,998,0002,371,584
3Nov 17, 2024 19:3138,163341,716,287314,758,0001,998,0002,289,664
4Nov 17, 2024 19:3138,175343,341,754314,853,0001,999,0002,289,664
5Nov 17, 2024 19:3138,196348,457,203317,029,00002,514,944
6Nov 17, 2024 19:3138,197344,738,424315,036,0002,000,0002,289,664
7Nov 17, 2024 19:3139,089350,035,951323,436,0001,001,0002,523,136
8Nov 17, 2024 19:3139,094354,284,317322,485,0001,996,0002,293,760
9Nov 17, 2024 19:3139,120350,586,192323,695,000999,0002,289,664