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 listDec 21, 2025 16:58jhallgreenjhallgreenScore: 54,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 16:5854,853479,381,841454,283,0001,000,0002,523,136
2Dec 21, 2025 16:5854,864484,896,857454,374,0001,000,0002,519,040
3Dec 21, 2025 16:5854,867481,056,368455,394,00002,375,680
4Dec 21, 2025 16:5854,870481,672,117455,424,00002,523,136
5Dec 21, 2025 16:5854,872482,552,973454,441,0001,000,0002,519,040
6Dec 21, 2025 16:5854,885482,120,857454,545,000999,0002,519,040
7Dec 21, 2025 16:5854,890484,718,705454,588,000999,0002,523,136
8Dec 21, 2025 16:5855,129484,359,165456,575,000999,0002,519,040
9Dec 21, 2025 16:5855,138482,627,090455,645,0001,998,0002,486,272