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 listJan 9, 2025 07:46Ian MckibbenIan MckibbenScore: 45,456Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 07:4645,278398,761,112373,806,0001,998,0002,506,752
2Jan 9, 2025 07:4645,356400,390,481375,451,0001,001,0002,506,752
3Jan 9, 2025 07:4645,451401,064,173375,239,0002,001,0002,359,296
4Jan 9, 2025 07:4645,452405,566,605376,248,0001,000,0002,506,752
5Jan 9, 2025 07:4645,456401,250,353376,281,0001,000,0002,359,296
6Jan 9, 2025 07:4645,464404,388,868376,351,0001,000,0002,289,664
7Jan 9, 2025 07:4645,470404,422,794376,397,0001,001,0002,289,664
8Jan 9, 2025 07:4645,472401,586,782376,416,0001,001,0002,289,664
9Jan 9, 2025 07:4645,478404,547,272377,471,00002,506,752