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 17, 2024 00:44Serge SmirnovSerge SmirnovScore: 31,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2024 00:4431,003286,676,474256,326,0001,001,0002,531,328
2Oct 17, 2024 00:4431,008279,193,120257,363,00002,273,280
3Oct 17, 2024 00:4431,016288,696,013256,433,0001,001,0002,531,328
4Oct 17, 2024 00:4431,017284,340,217256,436,0001,001,0002,293,760
5Oct 17, 2024 00:4431,026283,916,871256,512,0001,002,0002,293,760
6Oct 17, 2024 00:4431,030285,887,485256,543,0001,002,0002,293,760
7Oct 17, 2024 00:4431,030283,381,316257,549,00002,293,760
8Oct 17, 2024 00:4431,036288,459,032256,600,0001,002,0002,293,760
9Oct 17, 2024 00:4431,056282,975,827256,767,000999,0002,293,760