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 listNov 23, 2024 14:58E SequeiraE SequeiraScore: 13,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 14:5813,331139,926,771110,648,00002,281,472
2Nov 23, 2024 14:5813,348139,041,161109,790,000998,0002,289,664
3Nov 23, 2024 14:5813,348137,965,707108,790,0001,996,0002,478,080
4Nov 23, 2024 14:5813,349141,000,746108,798,0001,996,0002,289,664
5Nov 23, 2024 14:5813,353142,908,499108,835,0001,996,0002,469,888
6Nov 23, 2024 14:5813,355138,096,060108,850,0001,997,0002,281,472
7Nov 23, 2024 14:5813,355138,758,223109,850,000998,0002,469,888
8Nov 23, 2024 14:5813,358136,392,520108,878,0001,997,0002,289,664
9Nov 23, 2024 14:5813,364141,851,293109,922,000999,0002,289,664