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 12, 2024 20:09Alexander KosachevAlexander KosachevScore: 85,571Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2024 20:0285,525730,054,801708,857,000999,0002,478,080
2Nov 12, 2024 20:0285,542733,727,912709,998,00002,486,272
3Nov 12, 2024 20:0285,547729,887,147709,042,0001,000,0002,531,328
4Nov 12, 2024 20:0485,558732,061,733709,134,0001,000,0002,478,080
5Nov 12, 2024 20:0485,571734,954,479709,243,000998,0002,486,272
6Nov 12, 2024 20:0985,571730,609,486710,237,00002,527,232
7Nov 12, 2024 20:0985,587742,874,199710,376,00002,482,176
8Nov 12, 2024 20:0985,595738,039,900709,439,000999,0002,527,232
9Nov 12, 2024 20:0485,606737,227,170709,533,000999,0002,535,424