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 9, 2023 09:59Vladimir TatVladimir TatScore: 1,623,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2023 09:591,620,83913,512,627,68013,452,962,69402,265,088
2Oct 9, 2023 09:591,623,43513,531,071,00513,474,510,64202,252,800
3Oct 9, 2023 09:591,625,81913,553,508,79613,494,293,78202,244,608