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 listOct 15, 2024 22:00Elnur RakhmatullinElnur RakhmatullinScore: 60,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2024 22:0052,327459,693,572433,312,0001,000,0002,277,376
2Oct 15, 2024 22:0052,339461,090,088433,417,0001,000,0002,277,376
3Oct 15, 2024 22:0052,343464,780,460433,450,0001,001,0002,535,424
4Oct 15, 2024 22:0160,165530,158,641498,369,0001,000,0002,277,376
5Oct 15, 2024 22:0160,207526,552,432496,721,0002,998,0002,277,376
6Oct 15, 2024 22:0160,239527,906,879497,988,0001,999,0002,527,232
7Oct 15, 2024 22:0067,533588,255,596558,529,0001,998,0002,371,584
8Oct 15, 2024 22:0067,611588,202,031559,173,0002,000,0002,375,680
9Oct 15, 2024 22:0067,613588,134,369558,187,0003,001,0002,277,376