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 listJan 16, 2022 22:25Yuriy LyfenkoYuriy LyfenkoScore: 31,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2022 22:2331,193334,148,751258,905,01502,215,936
2Jan 16, 2022 22:2331,194318,487,119258,909,99202,220,032
3Jan 16, 2022 22:2331,197327,485,216258,931,40802,211,840
4Jan 16, 2022 22:2331,201337,237,012258,965,93702,215,936
5Jan 16, 2022 22:2531,201324,560,190258,969,26502,211,840
6Jan 16, 2022 22:2531,203338,736,982258,981,65902,211,840
7Jan 16, 2022 22:2331,206326,356,847259,007,30202,211,840
8Jan 16, 2022 22:2331,215320,974,892259,085,01702,220,032
9Jan 16, 2022 22:2531,248330,177,505259,355,00802,228,224