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 7, 2026 14:34TonyTonyScore: 7,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 14:347,52772,303,94860,214,0002,266,0002,113,536
2Aug 7, 2026 14:347,52872,196,92760,237,0002,249,0002,113,536
3Aug 7, 2026 14:347,53172,330,17060,198,0002,310,0002,113,536
4Aug 7, 2026 14:347,55073,697,56360,451,0002,214,0002,113,536
5Aug 7, 2026 14:347,55872,536,95660,537,0002,197,0002,113,536
6Aug 7, 2026 14:347,56172,685,77260,467,0002,296,0002,113,536
7Aug 7, 2026 14:347,57672,730,39060,676,0002,209,0002,113,536
8Aug 7, 2026 14:347,58572,738,34160,703,0002,254,0002,113,536
9Aug 7, 2026 14:347,60072,855,37060,754,0002,327,0002,113,536