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 27, 2022 15:56apuxbtapuxbtScore: 1,641,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2022 15:561,636,10413,654,076,87813,579,660,03902,252,800
2Nov 27, 2022 15:561,641,90313,707,850,69113,627,796,80202,252,800
3Nov 27, 2022 15:561,686,30314,061,136,67813,996,315,44902,260,992