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 13:55timothygktimothygkScore: 38,208Success
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 13:5638,073326,879,787314,992,0001,021,0002,113,536
2Oct 17, 2026 13:5638,151327,414,118315,551,0001,107,0002,113,536
3Oct 17, 2026 13:5638,170327,592,691315,690,0001,123,0002,113,536
4Oct 17, 2026 13:5638,208327,871,303315,950,0001,178,0002,113,536
5Oct 17, 2026 13:5638,208327,925,319315,975,0001,152,0002,113,536
6Oct 17, 2026 13:5638,222328,708,615316,074,0001,171,0002,113,536
7Oct 17, 2026 13:5638,235328,174,703316,190,0001,161,0002,113,536
8Oct 17, 2026 13:5638,248328,248,847316,349,0001,112,0002,113,536
9Oct 17, 2026 13:5638,392329,440,934317,518,0001,139,0002,113,536