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 3, 2023 12:22Erdem KeskinErdem KeskinScore: 83,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2023 12:1783,887772,231,203696,265,99202,236,416
2Jul 3, 2023 12:2283,889770,327,222696,277,61402,236,416
3Jul 3, 2023 12:1783,898762,311,875696,356,65602,236,416
4Jul 3, 2023 12:1783,899759,681,093696,361,18402,236,416
5Jul 3, 2023 12:2283,906757,874,256696,423,76302,228,224
6Jul 3, 2023 12:2284,018768,559,825697,348,01302,240,512