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:42Ian MckibbenIan MckibbenScore: 47,856Success
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:4247,815419,657,437394,869,0001,999,0002,510,848
2Jan 9, 2025 07:4247,829419,087,935395,983,000999,0002,289,664
3Jan 9, 2025 07:4247,832424,740,105395,002,0002,000,0002,289,664
4Jan 9, 2025 07:4247,833419,034,918395,018,0002,000,0002,510,848
5Jan 9, 2025 07:4247,856420,785,553396,204,0001,000,0002,289,664
6Jan 9, 2025 07:4247,873417,944,226396,349,0001,000,0002,510,848
7Jan 9, 2025 07:4247,881426,370,077396,410,0001,001,0002,506,752
8Jan 9, 2025 07:4247,913425,297,720395,682,0001,998,0002,510,848
9Jan 9, 2025 07:4247,921420,469,938395,748,0001,998,0002,355,200