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 14, 2024 16:25Joad NacerJoad NacerScore: 4,720Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 16:254,59770,368,27835,146,0003,012,0002,535,424
2Oct 14, 2024 16:254,62664,643,17735,362,0003,031,0002,273,280
3Oct 14, 2024 16:254,64461,649,80237,535,0001,014,0002,531,328
4Oct 14, 2024 16:254,72059,653,93338,171,0001,004,0002,506,752
5Oct 14, 2024 16:254,73861,504,90937,313,0002,016,0002,318,336
6Oct 14, 2024 16:254,93273,392,77039,939,000998,0002,506,752