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 5, 2024 08:40kauruuskauruusScore: 140,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2024 08:40140,9241,195,918,6911,166,670,0002,999,0002,310,144
2Nov 5, 2024 08:40140,9241,196,628,0391,167,672,0001,999,0002,314,240
3Nov 5, 2024 08:40140,9561,195,257,4131,166,938,0002,997,0002,473,984
4Nov 5, 2024 08:40140,9611,196,843,5501,168,974,000999,0002,478,080
5Nov 5, 2024 08:40140,9651,196,391,4291,168,013,0002,000,0002,482,176
6Nov 5, 2024 08:40140,9761,200,506,0061,168,101,0002,000,0002,330,624
7Nov 5, 2024 08:40140,9811,198,561,1371,167,141,0003,000,0002,326,528
8Nov 5, 2024 08:40141,0131,202,061,8111,166,409,0003,997,0002,326,528
9Nov 5, 2024 08:40141,1171,197,240,3841,168,269,0002,998,0002,326,528