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 listJul 20, 2024 22:39UdbhavUdbhavError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2024 22:3900000Error: expected "53685086982355355 ", got "masks: "00000100010000000010000010000000" total masks: 16379008 unique masks: 872 ones: {4: 1101466, 3: 15039043, 2: 238499} last number size: {2: 1563290, 9: 1491582, 0: 1564268, 6: 1561124, 8: 1556388, 1: 15...