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 18, 2024 00:47zielajzielajScore: 3,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 18, 2024 00:473,51654,770,07227,173,0002,012,0002,379,776
2Nov 18, 2024 00:473,53358,903,62428,309,0001,011,0002,379,776
3Nov 18, 2024 00:473,59559,325,55129,840,00002,523,136
4Nov 18, 2024 00:473,72551,661,80828,925,0001,994,0002,400,256
5Nov 18, 2024 00:473,73153,270,03628,969,0001,997,0002,531,328
6Nov 18, 2024 00:473,74352,082,69729,063,0002,004,0002,269,184