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 13, 2022 22:31Kenneth MaplesKenneth MaplesScore: 100,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2022 22:3196,843868,386,558803,800,20002,269,184
2Oct 13, 2022 22:2097,403866,590,468808,444,87302,289,664
3Oct 13, 2022 22:2098,431873,831,849816,977,93402,277,376
4Oct 13, 2022 22:31100,919905,615,725837,626,59302,277,376
5Oct 13, 2022 22:31102,873912,973,766853,842,40002,277,376
6Oct 13, 2022 22:20103,188915,546,839856,462,76102,265,088