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 1, 2023 21:38sliceteamsliceteamScore: 16,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2023 21:3816,420157,113,937134,278,0002,004,0002,387,968
2Oct 1, 2023 21:3816,423163,942,574135,313,0001,002,0002,252,800
3Oct 1, 2023 21:3816,424162,052,366135,316,0001,002,0002,379,776
4Oct 1, 2023 21:3816,483161,644,436135,809,000998,0002,506,752
5Oct 1, 2023 21:3816,530163,804,663136,195,0001,001,0002,482,176
6Oct 1, 2023 21:3816,571164,477,934136,540,0001,003,0002,523,136
7Oct 1, 2023 21:3816,611161,541,954135,876,0001,998,0002,260,992
8Oct 1, 2023 21:3816,643164,638,416136,132,0002,001,0002,260,992
9Oct 1, 2023 21:3816,686198,540,389138,489,83702,273,280
10Oct 1, 2023 21:3816,690192,654,018138,526,45502,273,280
11Oct 1, 2023 21:3816,691212,040,051138,538,45202,269,184
12Oct 1, 2023 21:3816,780165,309,210137,269,0002,003,0002,260,992