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 5, 2023 03:28Radek SzymanskiRadek SzymanskiScore: 74,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2023 03:4274,453685,092,790617,959,42802,260,992
2Jul 5, 2023 03:4274,635683,456,347619,469,60402,269,184
3Jul 5, 2023 03:4274,714687,163,889620,123,09402,269,184
4Jul 5, 2023 03:2874,766677,713,527620,557,55402,256,896
5Jul 5, 2023 03:2874,810686,196,738620,923,94502,256,896
6Jul 5, 2023 03:2874,930694,474,391621,920,73702,265,088