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 18:07Genos0Genos0Score: 71,795Success
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 18:0770,934598,696,150587,540,0001,213,0002,113,536
2Aug 7, 2026 18:0771,770605,558,242594,441,0001,254,0002,113,536
3Aug 7, 2026 18:0771,773605,511,800594,518,0001,206,0002,113,536
4Aug 7, 2026 18:0771,787605,674,588594,595,0001,238,0002,113,536
5Aug 7, 2026 18:0771,795605,871,908594,665,0001,241,0002,113,536
6Aug 7, 2026 18:0771,798605,691,559594,684,0001,242,0002,113,536
7Aug 7, 2026 18:0771,806605,823,173594,736,0001,262,0002,113,536
8Aug 7, 2026 18:0771,819606,056,617595,098,0001,002,0002,113,536
9Aug 7, 2026 18:0771,835606,756,551595,043,0001,189,0002,113,536