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 listApr 15, 2025 22:49k1k1Score: 58,515Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2025 22:4958,476511,160,044485,347,00002,293,760
2Apr 15, 2025 22:4958,489513,873,501485,461,00002,277,376
3Apr 15, 2025 22:4958,510513,427,524482,634,0002,997,0002,277,376
4Apr 15, 2025 22:4958,513512,281,561483,656,0001,998,0002,387,968
5Apr 15, 2025 22:4958,515511,394,726482,678,0002,998,0002,277,376
6Apr 15, 2025 22:4958,518516,212,096483,700,0001,998,0002,265,088
7Apr 15, 2025 22:4958,525514,954,332482,760,0002,998,0002,265,088
8Apr 15, 2025 22:4958,535514,021,168483,841,0001,999,0002,281,472
9Apr 15, 2025 22:4958,545512,492,103484,926,000999,0002,277,376