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 19, 2024 00:53zielajzielajScore: 3,685Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2024 00:533,54150,285,50429,394,00002,531,328
2Nov 19, 2024 00:533,57353,162,76028,636,0001,022,0002,523,136
3Nov 19, 2024 00:533,60451,769,42928,915,000997,0002,523,136
4Nov 19, 2024 00:533,68558,962,02930,585,00002,527,232
5Nov 19, 2024 00:533,68553,013,73930,585,00002,531,328
6Nov 19, 2024 00:533,72256,264,23729,893,000996,0002,269,184