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 listApr 18, 2024 12:46Matt StuchlikMatt StuchlikScore: 13,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2024 12:4610,681156,023,04788,652,86002,240,512
2Apr 18, 2024 12:4610,721140,786,01688,986,91502,232,320
3Apr 18, 2024 12:4610,728160,503,19289,043,55702,232,320
4Apr 18, 2024 12:4613,069144,049,861106,465,0002,008,0002,285,568
5Apr 18, 2024 12:4613,092135,609,848104,673,0003,987,0002,490,368
6Apr 18, 2024 12:4613,145130,794,527107,100,0002,001,0002,482,176
7Apr 18, 2024 12:4613,156132,950,697106,193,0003,005,0002,486,272
8Apr 18, 2024 12:4613,158135,553,679105,206,0004,007,0002,277,376
9Apr 18, 2024 12:4613,170131,859,009107,304,0002,005,0002,285,568
10Apr 18, 2024 12:4613,179138,026,319108,391,000994,0002,285,568
11Apr 18, 2024 12:4613,230139,340,310107,811,0001,996,0002,277,376
12Apr 18, 2024 12:4613,245136,564,969106,933,0002,998,0002,486,272