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 03:25zielajzielajScore: 3,756Success
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 03:253,57758,669,53429,691,00002,342,912
2Nov 15, 2024 03:253,59754,720,04327,862,0001,990,0002,342,912
3Nov 15, 2024 03:253,59860,412,00928,867,000995,0002,527,232
4Nov 15, 2024 03:253,75654,534,65329,160,0002,011,0002,445,312
5Nov 15, 2024 03:253,75653,909,41030,166,0001,005,0002,367,488
6Nov 15, 2024 03:253,78354,350,03630,385,0001,012,0002,445,312