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 13:59Joad NacerJoad NacerScore: 4,578Success
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 13:594,50764,675,30034,373,0003,032,0002,351,104
2Oct 11, 2024 13:594,51764,215,64935,461,0002,026,0002,297,856
3Oct 11, 2024 13:594,51963,258,49534,466,0003,041,0002,285,568
4Oct 11, 2024 13:594,52362,637,18034,497,0003,043,0002,297,856
5Oct 11, 2024 13:594,52764,948,58235,543,0002,031,0002,306,048
6Oct 11, 2024 13:594,54063,003,78134,706,0002,974,0002,310,144
7Oct 11, 2024 13:594,57858,333,51135,997,0001,999,0002,301,952
8Oct 11, 2024 13:594,58059,244,39536,015,0002,000,0002,351,104
9Oct 11, 2024 13:594,58158,480,27536,019,0002,001,0002,351,104
10Oct 11, 2024 13:594,58862,370,62735,078,0003,006,0002,293,760
11Oct 11, 2024 13:594,59059,272,47335,088,0003,007,0002,301,952
12Oct 11, 2024 13:594,59958,803,16336,165,0002,009,0002,351,104