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 17, 2026 14:35Yuriy LyfenkoYuriy LyfenkoScore: 9,815Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 14:359,777108,293,57870,133,00011,020,0002,387,968
2Mar 17, 2026 14:359,815110,005,63373,419,0008,046,0002,482,176
3Mar 17, 2026 14:359,885111,268,35773,041,0009,005,0002,490,368