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 31, 2026 14:45Yuriy LyfenkoYuriy LyfenkoScore: 5,488Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 31, 2026 14:455,46773,426,21144,371,0001,008,0002,473,984
2Mar 31, 2026 14:455,48872,628,92644,538,0001,012,0002,478,080
3Mar 31, 2026 14:455,54476,672,83244,014,0002,000,0002,478,080