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 listOct 17, 2026 16:27timothygktimothygkScore: 38,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 16:3438,212328,525,177316,082,0001,082,0002,117,632stderr
2Oct 17, 2026 16:3438,236329,364,700316,362,0001,003,0002,117,632stderr
3Oct 17, 2026 16:3438,237328,688,848316,259,0001,112,0002,117,632stderr
4Oct 17, 2026 16:3438,238328,578,309316,280,0001,099,0002,117,632stderr
5Oct 17, 2026 16:3438,240328,771,536316,303,0001,090,0002,117,632stderr
6Oct 17, 2026 16:3438,243329,192,559316,419,0001,004,0002,117,632stderr
7Oct 17, 2026 16:3438,249328,920,082316,468,0001,004,0002,117,632stderr
8Oct 17, 2026 16:3438,261328,573,523316,511,0001,057,0002,117,632stderr
9Oct 17, 2026 16:3438,265332,159,408316,598,0001,002,0002,117,632stderr