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 6, 2025 23:00woodsy-sounding-wilful-sapwoodwoodsy-sounding-wilful-sapwoodScore: 58,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 6, 2025 23:0058,457508,169,204483,194,0002,000,0002,269,184
2Jan 6, 2025 23:0058,470510,467,771485,298,00002,273,280
3Jan 6, 2025 23:0058,472512,036,658484,320,0001,000,0002,289,664
4Jan 6, 2025 23:0058,473506,996,793484,324,0001,000,0002,519,040
5Jan 6, 2025 23:0058,495514,290,875483,508,0001,997,0002,289,664
6Jan 6, 2025 23:0058,514513,418,531483,670,0001,998,0002,289,664
7Jan 6, 2025 23:0058,530514,203,904483,799,0001,999,0002,289,664
8Jan 6, 2025 23:0058,538509,695,451483,866,0001,999,0002,289,664
9Jan 6, 2025 23:0058,545511,084,316483,923,0001,999,0002,289,664