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 22, 2024 21:34UdbhavUdbhavError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2024 21:3400000Error: expected "53682351767342164 ", got "total masks: 16378928 unique masks: 870 ones: {3: 15039182, 4: 1101478, 2: 238268} last number size: {9: 1488901, 10: 833899, 8: 1553490, 0: 1561607, 3: 1563808, 7: 1562379, 6: 1565992, 1: 1562040, 4: 1560456,...