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 listMar 14, 2024 13:40Matt StuchlikMatt StuchlikScore: 29,878Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2024 13:4029,837274,198,160244,653,0002,995,0002,273,280
2Mar 14, 2024 13:4029,854271,785,255246,792,000999,0002,273,280
3Mar 14, 2024 13:4029,868276,653,937244,903,0002,998,0002,273,280
4Mar 14, 2024 13:4029,872271,316,716245,936,0001,999,0002,519,040
5Mar 14, 2024 13:4029,876271,956,461244,975,0002,999,0002,260,992
6Mar 14, 2024 13:4029,878272,480,161245,990,0001,999,0002,273,280
7Mar 14, 2024 13:4029,878273,222,972246,991,000999,0002,273,280
8Mar 14, 2024 13:4029,900275,635,318246,170,0002,001,0002,273,280
9Mar 14, 2024 13:4029,921274,857,872246,340,0002,002,0002,527,232
10Mar 14, 2024 13:4029,930315,572,525248,417,84702,281,472
11Mar 14, 2024 13:4029,938317,495,356248,482,21102,285,568
12Mar 14, 2024 13:4029,945309,962,762248,543,36102,297,856