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 29, 2024 03:23Liam BuchananLiam BuchananError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 29, 2024 03:2300000Error: expected "53681182840158302 ", got "matches: 0000000000100000 shuf: 000001155209419218 val: -1332807480, mask: 1024, mi: 11, os: 0 matches: 0000000001000000 shuf: 000000283121040218 val: -1463756678, mask: 512, mi: 10, os: 11 1155209419 1530032...stderr