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 19, 2025 10:39Brandon TangBrandon TangScore: 54,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2025 10:3954,454474,810,313449,971,0001,999,0002,289,664
2Mar 19, 2025 10:3954,454474,411,626449,971,0001,999,0002,363,392
3Mar 19, 2025 10:3954,480474,588,779451,182,0001,000,0002,359,296
4Mar 19, 2025 10:3954,480479,523,850451,181,0001,000,0002,523,136
5Mar 19, 2025 10:3954,508479,934,978450,420,0001,997,0002,281,472
6Mar 19, 2025 10:3954,510478,654,972450,438,0001,997,0002,289,664
7Mar 19, 2025 10:3954,519481,416,057450,507,0001,997,0002,265,088
8Mar 19, 2025 10:3954,532480,625,569451,615,0001,001,0002,281,472
9Mar 19, 2025 10:3954,618479,588,772450,328,0003,002,0002,281,472