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 listOct 17, 2025 13:37RyogaRyogaScore: 52,199Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2025 13:3752,149456,885,856430,834,0001,999,0002,473,984
2Oct 17, 2025 13:3752,166454,441,067431,978,000999,0002,469,888
3Oct 17, 2025 13:3752,176458,145,126432,061,0001,000,0002,482,176
4Oct 17, 2025 13:3752,190456,316,611432,177,0001,000,0002,482,176
5Oct 17, 2025 13:3752,199458,657,296433,248,00002,527,232
6Oct 17, 2025 13:3752,211459,076,876432,355,0001,000,0002,486,272
7Oct 17, 2025 13:3752,215461,880,418432,382,0001,000,0002,265,088
8Oct 17, 2025 13:3752,221453,190,994433,437,00002,527,232
9Oct 17, 2025 13:3752,225458,258,041433,465,00002,486,272