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 18, 2026 17:56Yuriy LyfenkoYuriy LyfenkoScore: 4,654Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 17:564,65166,892,32937,590,0001,015,0002,531,328
2Mar 18, 2026 17:564,65468,149,72037,609,0001,016,0002,478,080
3Mar 18, 2026 17:564,83365,351,46138,106,0002,005,0002,310,144