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 8, 2023 19:25sliceteamsliceteamScore: 12,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2023 19:2512,753130,766,655103,854,0001,997,0002,260,992
2Oct 8, 2023 19:2512,762132,969,803103,925,0001,998,0002,387,968
3Oct 8, 2023 19:2512,765137,050,254103,950,0001,999,0002,260,992
4Oct 8, 2023 19:2512,771135,950,598104,002,0002,000,0002,375,680
5Oct 8, 2023 19:2512,773132,320,324104,014,0002,000,0002,387,968
6Oct 8, 2023 19:2512,779133,870,287104,062,0002,001,0002,387,968
7Oct 8, 2023 19:2512,783132,915,170104,098,0002,001,0002,392,064
8Oct 8, 2023 19:2512,796133,763,002105,202,0001,001,0002,260,992
9Oct 8, 2023 19:2512,863132,491,936105,766,000997,0002,260,992
10Oct 8, 2023 19:2513,696197,830,925113,677,15902,265,088
11Oct 8, 2023 19:2513,905190,021,993115,411,34802,265,088
12Oct 8, 2023 19:2514,196185,560,382117,830,76302,269,184