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 9, 2024 09:55matsuoka-601matsuoka-601Score: 6,904Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2024 09:556,82286,608,13455,610,0001,011,0002,392,064
2Feb 9, 2024 09:556,84884,890,68854,845,0001,994,0002,523,136
3Feb 9, 2024 09:556,84884,149,76555,841,000997,0002,523,136
4Feb 9, 2024 09:556,85088,627,38355,858,000997,0002,523,136
5Feb 9, 2024 09:556,85080,812,59154,861,0001,994,0002,408,448
6Feb 9, 2024 09:556,86879,736,70856,007,0001,000,0002,514,944
7Feb 9, 2024 09:556,90484,978,65356,300,0001,005,0002,523,136
8Feb 9, 2024 09:556,91186,096,71856,353,0001,006,0002,408,448
9Feb 9, 2024 09:556,978126,222,68157,919,75402,289,664
10Feb 9, 2024 09:556,98781,810,10355,994,0001,999,0002,404,352
11Feb 9, 2024 09:556,998122,005,09758,084,68402,289,664
12Feb 9, 2024 09:557,096140,734,53958,893,79802,289,664