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 1, 2026 23:40TonyTonyScore: 29,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 23:4128,715248,196,126237,156,0001,181,0002,113,536
2Aug 1, 2026 23:4128,715248,231,202237,157,0001,183,0002,113,536
3Aug 1, 2026 23:4128,963250,369,880239,150,0001,250,0002,113,536
4Aug 1, 2026 23:4129,739256,748,051245,648,0001,192,0002,113,536
5Aug 1, 2026 23:4129,751256,808,784245,748,0001,192,0002,113,536
6Aug 1, 2026 23:4129,751256,850,065245,743,0001,197,0002,113,536
7Aug 1, 2026 23:4129,819257,458,092246,298,0001,206,0002,113,536
8Aug 1, 2026 23:4129,819257,386,084246,312,0001,188,0002,113,536
9Aug 1, 2026 23:4129,820257,414,007246,280,0001,226,0002,113,536