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 listJul 4, 2023 20:21Radek SzymanskiRadek SzymanskiScore: 81,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2023 20:2281,289744,786,501674,700,50002,236,416
2Jul 4, 2023 20:2281,382739,293,552675,471,75602,240,512
3Jul 4, 2023 20:2281,387738,665,537675,516,03002,244,608
4Jul 4, 2023 20:2181,394732,602,835675,568,63302,240,512
5Jul 4, 2023 20:2281,422745,503,666675,800,32402,232,320
6Jul 4, 2023 20:2181,439753,541,686675,946,50202,240,512
7Jul 4, 2023 20:2281,574762,049,370677,061,94002,232,320
8Jul 4, 2023 20:2181,579739,090,795677,103,63602,240,512
9Jul 4, 2023 20:2281,671732,136,799677,872,24102,248,704