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 listOct 5, 2023 01:11apuxbtapuxbtScore: 125,771Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2023 01:11125,6301,111,083,0161,042,725,10902,269,184
2Oct 5, 2023 01:11125,7711,110,391,2621,043,896,07702,244,608
3Oct 5, 2023 01:11125,8061,104,214,2241,044,189,85602,244,608