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 listJun 22, 2026 11:11Omkar SinghOmkar SinghScore: 220,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 11:12220,5891,840,138,4861,766,827,00064,068,0002,113,536
2Jun 22, 2026 11:12220,6411,841,770,3921,766,247,00065,080,0002,113,536
3Jun 22, 2026 11:12220,6881,840,755,1691,766,608,00065,109,0002,113,536
4Jun 22, 2026 11:12220,7611,841,648,5791,766,203,00066,118,0002,113,536
5Jun 22, 2026 11:12220,8701,842,325,4301,767,062,00066,167,0002,113,536
6Jun 22, 2026 11:12221,7521,849,748,4771,777,476,00063,070,0002,113,536
7Jun 22, 2026 11:12221,7891,849,977,4491,776,770,00064,085,0002,113,536
8Jun 22, 2026 11:12221,9861,851,830,1571,778,414,00064,077,0002,113,536
9Jun 22, 2026 11:12226,8411,891,907,8911,819,723,00063,065,0002,113,536