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 2, 2025 17:48ndrenndrenScore: 59,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 2, 2025 17:4859,195513,373,477490,316,0001,000,0002,392,064
2Apr 2, 2025 17:4859,206518,156,534491,408,00002,523,136
3Apr 2, 2025 17:4859,230517,156,445489,613,0001,998,0002,387,968
4Apr 2, 2025 17:4859,233520,024,486491,636,00002,252,800
5Apr 2, 2025 17:4859,233523,874,169489,633,0001,998,0002,523,136
6Apr 2, 2025 17:4859,240516,487,574490,696,000999,0002,265,088
7Apr 2, 2025 17:4859,241520,304,851489,704,0001,998,0002,260,992
8Apr 2, 2025 17:4859,251516,694,636490,784,000999,0002,392,064
9Apr 2, 2025 17:4859,255521,096,165490,814,000999,0002,523,136