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 2, 2026 19:30Karthik ReddyKarthik ReddyScore: 4,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 19:344,3753,045,394,41326,439,0009,877,00045,056
2Oct 2, 2026 19:344,3913,045,519,35926,387,00010,062,00045,056
3Oct 2, 2026 19:344,4163,045,827,59426,462,00010,195,00045,056
4Oct 2, 2026 19:344,5133,046,643,54326,523,00010,936,00045,056
5Oct 2, 2026 19:344,5373,046,793,96626,550,00011,108,00045,056
6Oct 2, 2026 19:344,5703,047,063,18426,758,00011,175,00045,056
7Oct 2, 2026 19:344,7413,048,433,17726,602,00012,756,00045,056
8Oct 2, 2026 19:344,7583,048,705,69226,900,00012,595,00045,056
9Oct 2, 2026 19:344,7973,049,034,95926,645,00013,175,00045,056