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 24, 2026 11:41satoru.netsatoru.netScore: 32,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 11:4131,927291,649,770262,991,0001,999,0002,400,256
2Feb 24, 2026 11:4132,086289,926,617266,315,00002,277,376
3Feb 24, 2026 11:4132,102293,479,451265,443,0001,001,0002,396,160