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 15, 2023 19:09Serge SmirnovSerge SmirnovScore: 41,572Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2023 19:0941,530426,535,318344,697,73102,281,472
2Oct 15, 2023 19:0941,557404,090,964344,920,05202,285,568
3Oct 15, 2023 19:0941,570411,583,053345,032,99102,293,760
4Oct 15, 2023 19:0941,570411,829,049345,027,78602,289,664
5Oct 15, 2023 19:0941,572415,977,249345,047,99302,293,760
6Oct 15, 2023 19:0941,575408,562,487345,071,68102,293,760
7Oct 15, 2023 19:0941,578410,711,793345,100,53602,281,472
8Oct 15, 2023 19:0941,586416,585,921345,161,26002,277,376
9Oct 15, 2023 19:0941,594399,516,874345,233,51402,297,856