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 15, 2024 01:25zielajzielajScore: 3,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 01:253,85351,373,61730,978,000999,0002,523,136
2Nov 15, 2024 01:253,88058,613,58530,191,0002,012,0002,428,928
3Nov 15, 2024 01:253,89560,719,91030,311,0002,020,0002,342,912
4Nov 15, 2024 01:253,91953,432,72332,527,00002,363,392
5Nov 15, 2024 01:253,93164,958,74032,628,00002,359,296
6Nov 15, 2024 01:253,94056,968,91432,702,00002,367,488