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 00:01Ian MckibbenIan MckibbenScore: 51,366Success
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 00:0151,140447,320,015424,459,00002,289,664
2Jan 9, 2025 00:0151,297453,508,221423,770,0001,998,0002,293,760
3Jan 9, 2025 01:0951,329449,680,950424,028,0002,000,0002,289,664
4Jan 9, 2025 00:0151,331452,258,049424,044,0002,000,0002,289,664
5Jan 9, 2025 01:0951,333453,946,902424,064,0002,000,0002,289,664
6Jan 9, 2025 00:0151,343453,559,773424,144,0002,000,0002,289,664
7Jan 9, 2025 00:0151,366451,316,312425,339,0001,000,0002,289,664
8Jan 9, 2025 00:0151,401456,138,643424,634,0001,998,0002,289,664
9Jan 9, 2025 00:0151,405453,341,959425,664,000999,0002,273,280
10Jan 9, 2025 00:0151,406452,778,645424,674,0001,998,0002,289,664
11Jan 9, 2025 01:0951,507462,251,569426,507,0001,001,0002,281,472
12Jan 9, 2025 00:0151,518463,109,855426,599,000999,0002,371,584