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 listFeb 16, 2026 19:18wnwnScore: 10,312Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2026 19:1810,254108,144,45080,105,0005,006,0002,486,272
2Feb 16, 2026 19:1810,312110,423,79081,562,0004,027,0002,285,568
3Feb 16, 2026 19:1810,410110,138,57181,378,0005,023,0002,301,952