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:49Radek SzymanskiRadek SzymanskiScore: 80,642Success
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:4980,485727,684,089668,023,11602,260,992
2Jul 4, 2023 20:4980,549735,247,621668,553,73102,269,184
3Jul 4, 2023 20:4980,618727,830,658669,133,24402,252,800
4Jul 4, 2023 20:4980,642740,056,074669,332,24702,265,088
5Jul 4, 2023 20:4980,643736,716,380669,336,24102,256,896
6Jul 4, 2023 20:4980,657731,446,430669,452,18202,265,088