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 listAug 7, 2026 15:12TonyTonyScore: 112,673Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 15:12112,612944,561,158932,237,0002,448,0002,113,536
2Aug 7, 2026 15:12112,653944,815,091932,498,0002,525,0002,113,536
3Aug 7, 2026 15:12112,655944,924,934932,462,0002,575,0002,113,536
4Aug 7, 2026 15:12112,672945,061,374932,577,0002,603,0002,113,536
5Aug 7, 2026 15:12112,673945,122,486932,602,0002,584,0002,113,536
6Aug 7, 2026 15:12112,698945,318,504932,685,0002,712,0002,113,536
7Aug 7, 2026 15:12112,723945,509,351933,005,0002,603,0002,113,536
8Aug 7, 2026 15:12112,730945,592,877933,056,0002,606,0002,113,536
9Aug 7, 2026 15:12112,762945,766,540933,494,0002,432,0002,113,536