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 2, 2023 19:47dzaimadzaimaScore: 20,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2023 19:4720,933202,704,507172,750,000998,0002,260,992
2Jul 2, 2023 19:4720,937202,096,457172,778,000998,0002,260,992
3Jul 2, 2023 19:4720,943199,628,983171,831,0001,998,0002,392,064
4Jul 2, 2023 19:4720,945200,142,637171,848,0001,998,0002,260,992
5Jul 2, 2023 19:4720,946201,821,871171,851,0001,998,0002,392,064
6Jul 2, 2023 19:4720,965224,728,330174,012,91502,269,184
7Jul 2, 2023 19:4720,970199,339,980173,053,0001,000,0002,519,040
8Jul 2, 2023 19:4720,976200,727,892173,104,0001,000,0002,523,136
9Jul 2, 2023 19:4720,978230,575,776174,113,70802,277,376
10Jul 2, 2023 19:4720,987234,241,784174,192,16402,256,896
11Jul 2, 2023 19:4720,987200,244,031172,190,0002,002,0002,260,992
12Jul 2, 2023 19:4720,988198,495,254172,198,0002,002,0002,379,776