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, 2024 20:43Elnur RakhmatullinElnur RakhmatullinScore: 49,450Success
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, 2024 20:4349,428434,270,595409,254,0001,000,0002,277,376
2Oct 15, 2024 20:4349,434438,162,094409,299,0001,000,0002,277,376
3Oct 15, 2024 20:4349,434432,600,856408,303,0002,001,0002,277,376
4Oct 15, 2024 20:4349,442440,522,596410,367,00002,277,376
5Oct 15, 2024 20:4349,450442,199,711409,437,0001,001,0002,293,760
6Oct 15, 2024 20:4349,459440,595,694406,514,0003,995,0002,375,680
7Oct 15, 2024 20:4349,471439,388,568409,610,000999,0002,265,088
8Oct 15, 2024 20:4349,472438,399,605408,618,0001,998,0002,277,376
9Oct 15, 2024 20:4349,479442,496,380407,676,0002,997,0002,269,184