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 listMar 24, 2025 15:10Foo Chuan Le, NicholasFoo Chuan Le, NicholasScore: 1,833,555Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2025 15:101,832,68115,248,273,89515,138,286,00072,967,0002,289,664
2Mar 24, 2025 15:101,833,55515,248,401,79715,146,539,00071,969,0002,289,664
3Mar 24, 2025 15:101,833,93315,254,630,80215,154,679,00066,967,0002,269,184