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 listNov 11, 2024 09:00AndreyAndreyScore: 394,252Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 09:00393,6383,299,824,2113,201,232,00065,963,0002,293,760
2Nov 11, 2024 09:00393,6713,293,911,0373,188,508,00078,963,0002,367,488
3Nov 11, 2024 09:00393,7243,298,799,1503,199,955,00067,956,0002,293,760
4Nov 11, 2024 09:00393,8143,298,708,6283,209,679,00058,975,0002,371,584
5Nov 11, 2024 09:00394,2523,302,202,1623,212,326,00059,968,0002,289,664
6Nov 11, 2024 09:00394,3273,302,741,3553,215,948,00056,963,0002,285,568
7Nov 11, 2024 09:00395,9353,318,760,6833,231,291,00054,970,0002,293,760
8Nov 11, 2024 09:00396,6543,325,871,0393,228,265,00063,965,0002,285,568
9Nov 11, 2024 09:00438,0673,665,183,1923,565,995,00069,960,0002,285,568