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 listMay 26, 2024 16:23Matt StuchlikMatt StuchlikError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2024 16:2300000Error: expected "53682952330723604 ", got "Shuffle ctrl1 is zero for mask 8913922 53682976798701127 "
2May 26, 2024 16:2300000Error: Exit with code 1: Segmentation fault at address: 1342439936stderr
3May 26, 2024 16:2400000Error: expected "53690538262771332 ", got "Shuffle ctrl1 is zero for mask 4202501 Shuffle ctrl1 is zero for mask 134291464 53690559959079043 "
4May 26, 2024 16:2400000Error: expected "53691816256685483 ", got "Shuffle ctrl1 is zero for mask 33620484 53691823690036681 "
5May 26, 2024 16:237,431124,727,75061,674,81202,281,472
6May 26, 2024 16:237,474122,330,05562,033,03902,240,512
7May 26, 2024 16:237,495132,050,48262,210,42402,306,048