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 listAug 19, 2022 19:25Kanishk AroraKanishk AroraScore: 1,641,361Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2022 19:251,636,18313,651,089,55213,580,317,58602,248,704
2Aug 19, 2022 19:251,641,36113,690,111,59613,623,295,68902,252,800
3Aug 19, 2022 19:251,641,85013,686,674,07013,627,355,20902,256,896