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 listFeb 22, 2025 19:06alfaixalfaixScore: 135,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2025 19:06135,2261,147,015,5441,120,376,0001,998,0002,281,472
2Feb 22, 2025 19:06135,2421,145,259,7921,120,506,0001,999,0002,289,664
3Feb 22, 2025 19:06135,3331,148,131,6711,121,270,0001,998,0002,289,664
4Feb 22, 2025 19:06135,3551,147,096,0391,122,451,000999,0002,281,472
5Feb 22, 2025 19:06135,3691,146,868,7671,121,566,0001,999,0002,289,664
6Feb 22, 2025 19:06135,4051,151,571,4441,122,859,000999,0002,269,184
7Feb 22, 2025 19:06135,4121,147,779,8391,122,922,000999,0002,289,664
8Feb 22, 2025 19:06135,4151,147,901,8271,122,946,000999,0002,289,664
9Feb 22, 2025 19:06135,4731,153,130,0721,122,426,0001,998,0002,277,376