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 listSep 19, 2026 13:33Andrew EpsteinAndrew EpsteinScore: 125,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 14:09125,2611,049,971,6011,037,489,0002,184,0002,121,728stderr
2Sep 19, 2026 14:09125,3271,050,506,3151,038,022,0002,194,0002,121,728stderr
3Sep 19, 2026 14:09125,3321,050,573,9101,038,061,0002,200,0002,121,728stderr
4Sep 19, 2026 14:09125,3391,050,693,0301,038,128,0002,191,0002,121,728stderr
5Sep 19, 2026 14:09125,3431,050,649,8751,038,282,0002,065,0002,121,728stderr
6Sep 19, 2026 14:09125,3491,050,663,7711,038,254,0002,149,0002,121,728stderr
7Sep 19, 2026 14:09125,3931,051,110,9171,038,640,0002,129,0002,121,728stderr
8Sep 19, 2026 14:09125,4331,051,490,5981,039,089,0002,012,0002,121,728stderr
9Sep 19, 2026 14:09125,4411,051,524,0921,039,151,0002,014,0002,121,728stderr