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 11, 2024 12:26ZOTTIGZOTTIGScore: 85,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 12:2684,796731,630,217639,826,00063,982,0002,326,528
2Nov 11, 2024 12:2685,250741,664,957644,617,00062,962,0002,482,176
3Nov 11, 2024 12:2685,268730,986,238640,751,00066,973,0002,326,528
4Nov 11, 2024 12:2685,289731,129,460638,910,00068,990,0002,482,176
5Nov 11, 2024 12:2685,297732,391,377643,968,00063,996,0002,473,984
6Nov 11, 2024 12:2685,511739,538,851650,760,00058,978,0002,330,624
7Nov 11, 2024 12:2685,605740,373,148653,558,00056,961,0002,486,272
8Nov 11, 2024 12:2686,045739,106,897662,164,00052,012,0002,326,528
9Nov 11, 2024 12:2686,395744,057,784645,174,00071,907,0002,326,528