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 5, 2026 23:10rubanrubanScore: 38,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 23:1038,145344,884,616312,606,0003,994,0002,289,664
2Feb 5, 2026 23:1038,443348,122,650317,081,0002,000,0002,289,664
3Feb 5, 2026 23:1038,454344,128,231319,171,00002,289,664