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 17:35Elijah KinElijah KinScore: 49,437Success
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 17:3549,420432,545,140409,183,0001,000,0002,379,776
2Mar 23, 2026 17:3549,425432,316,361409,226,0001,000,0002,523,136
3Mar 23, 2026 17:3549,427437,764,592409,242,0001,000,0002,519,040
4Mar 23, 2026 17:3549,429434,920,503409,257,0001,000,0002,396,160
5Mar 23, 2026 17:3549,437433,763,414409,323,0001,000,0002,519,040
6Mar 23, 2026 17:3549,439435,280,811408,344,0002,001,0002,510,848
7Mar 23, 2026 17:3549,448435,244,360409,420,000998,0002,502,656
8Mar 23, 2026 17:3549,460441,167,288410,518,00002,379,776
9Mar 23, 2026 17:3549,478434,762,567409,670,000999,0002,371,584