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 listAug 2, 2026 11:54TonyTonyScore: 14,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 11:5414,919133,652,446102,389,00021,444,0002,113,536
2Aug 2, 2026 11:5414,926133,716,291102,435,00021,457,0002,113,536
3Aug 2, 2026 11:5414,931133,797,548102,432,00021,496,0002,113,536
4Aug 2, 2026 11:5414,932133,745,265102,438,00021,501,0002,113,536
5Aug 2, 2026 11:5414,934133,863,392102,490,00021,465,0002,113,536
6Aug 2, 2026 11:5414,936133,887,469102,502,00021,471,0002,113,536
7Aug 2, 2026 11:5414,938133,898,860102,429,00021,562,0002,113,536
8Aug 2, 2026 11:5414,941133,839,617102,480,00021,538,0002,113,536
9Aug 2, 2026 11:5414,944133,886,184102,513,00021,526,0002,113,536