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 listDec 13, 2024 16:12AnSaAnSaScore: 21,656Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2024 16:0621,608203,367,137179,346,00002,273,280
2Dec 13, 2024 16:1221,613205,114,998178,388,0001,002,0002,273,280
3Sep 3, 2024 16:0621,626206,348,529178,496,0001,002,0002,273,280
4Sep 3, 2024 16:0621,627202,794,424177,508,0001,994,0002,531,328
5Sep 3, 2024 16:0621,632208,980,644178,542,0001,003,0002,269,184
6Sep 3, 2024 16:0621,634210,589,188177,560,0002,006,0002,265,088
7Sep 3, 2024 16:0621,656209,196,660177,746,0001,997,0002,273,280
8Dec 13, 2024 16:1221,657209,908,994178,757,000998,0002,269,184
9Sep 3, 2024 16:0621,842208,645,451179,285,0002,003,0002,273,280
10Dec 13, 2024 16:1221,863209,225,871180,462,0001,002,0002,523,136
11Sep 3, 2024 16:0621,869209,943,625180,511,0001,002,0002,273,280
12Sep 3, 2024 16:0622,221203,432,577182,430,0002,004,0002,392,064