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 listMar 23, 2026 19:40Elijah KinElijah KinScore: 49,406Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 19:4049,398435,241,891409,001,0001,000,0002,523,136
2Mar 23, 2026 19:4049,404435,756,403409,051,0001,000,0002,478,080
3Mar 23, 2026 19:4049,405435,307,279408,061,0002,000,0002,383,872
4Mar 23, 2026 19:4049,405438,085,067408,062,0002,000,0002,396,160
5Mar 23, 2026 19:4049,406438,390,147409,072,0001,000,0002,523,136
6Mar 23, 2026 19:4049,407431,882,819409,082,0001,000,0002,498,560
7Mar 23, 2026 19:4049,414441,728,852408,137,0002,000,0002,527,232
8Mar 23, 2026 19:4049,421430,550,853410,194,00002,387,968
9Mar 23, 2026 19:4049,429440,947,691409,259,0001,000,0002,465,792