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 07:11Alexander KosachevAlexander KosachevScore: 161,423Success
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 07:11161,2021,363,812,3531,336,979,000999,0002,281,472
2Nov 11, 2024 07:11161,2271,366,075,6591,337,182,000999,0002,478,080
3Nov 11, 2024 07:11161,2481,360,809,0231,336,359,0001,999,0002,281,472
4Nov 11, 2024 07:11161,4141,362,961,3531,338,735,000999,0002,473,984
5Nov 11, 2024 07:11161,4231,367,146,7121,338,808,000999,0002,281,472
6Nov 11, 2024 07:11161,4901,361,591,5531,338,369,0001,999,0002,281,472
7Nov 11, 2024 07:11161,5061,366,756,6701,338,503,0001,999,0002,469,888
8Nov 11, 2024 07:11161,7351,368,493,8901,341,400,000999,0002,473,984
9Nov 11, 2024 07:11161,8781,368,717,3261,342,591,000999,0002,281,472