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 11, 2024 13:31ivanivanScore: 84,278Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 13:3184,143730,741,015637,438,00060,946,0002,293,760
2Nov 11, 2024 13:3184,159734,717,452629,567,00068,952,0002,293,760
3Nov 11, 2024 13:3184,186720,250,648634,769,00063,976,0002,506,752
4Nov 11, 2024 13:3184,223727,005,939620,049,00079,006,0002,359,296
5Nov 11, 2024 13:3184,278732,504,844631,557,00067,952,0002,367,488
6Nov 11, 2024 13:3184,363721,671,211628,191,00072,022,0002,293,760
7Nov 11, 2024 13:3184,380730,159,329632,319,00068,034,0002,293,760
8Nov 11, 2024 13:3184,401728,973,534630,576,00069,953,0002,285,568
9Nov 11, 2024 13:3184,594723,032,669628,117,00074,013,0002,293,760