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 listAug 21, 2025 18:23Ruoyu QiuRuoyu QiuScore: 61,636Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2025 18:2361,615537,964,523510,401,0001,000,0002,256,896
2Aug 21, 2025 18:2361,618545,410,687511,432,00002,510,848
3Aug 21, 2025 18:2361,634537,604,993510,561,000999,0002,256,896
4Aug 21, 2025 18:2361,634536,844,634509,568,0001,998,0002,519,040
5Aug 21, 2025 18:2361,636540,179,095509,584,0001,998,0002,260,992
6Aug 21, 2025 18:2361,643542,916,308508,637,0002,997,0002,519,040
7Aug 21, 2025 18:2361,645535,131,911509,654,0001,998,0002,387,968
8Aug 21, 2025 18:2361,646541,301,220509,667,0001,998,0002,375,680
9Aug 21, 2025 18:2361,764540,880,933508,648,0003,997,0002,510,848