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 11, 2024 02:47Joad NacerJoad NacerScore: 4,766Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 02:474,69366,390,98236,954,0001,997,0002,375,680
2Oct 11, 2024 02:474,73163,377,00836,247,0003,020,0002,375,680
3Oct 11, 2024 02:474,74363,462,40437,352,0002,019,0002,334,720
4Oct 11, 2024 02:474,76668,794,55237,532,0002,028,0002,367,488
5Oct 11, 2024 02:474,79567,166,38235,817,0003,979,0002,367,488
6Oct 11, 2024 02:474,84669,125,57138,210,0002,011,0002,420,736