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 25, 2025 14:35bendnbendnScore: 58,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 25, 2025 14:3557,941507,543,164478,910,0001,999,0002,273,280
2Jan 25, 2025 14:3557,948512,631,745478,970,0001,999,0002,289,664
3Jan 25, 2025 14:3558,144514,987,724480,597,0001,998,0002,269,184
4Jan 25, 2025 14:3558,170511,758,031480,815,0001,999,0002,289,664
5Jan 25, 2025 14:3558,651513,882,918485,801,000999,0002,289,664
6Jan 25, 2025 14:3558,659513,253,421483,868,0002,999,0002,289,664
7Jan 25, 2025 14:3558,696515,445,534486,180,0001,000,0002,265,088
8Jan 25, 2025 14:3558,711509,258,406486,301,0001,000,0002,281,472
9Jan 25, 2025 14:3558,750513,943,838485,626,0001,998,0002,289,664