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 listOct 8, 2024 07:16matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2024 07:1700000Error: No answer to stdout. Died or killed?stderr
2Oct 8, 2024 07:1682,622706,440,614682,765,0002,998,0002,285,568
3Oct 8, 2024 07:1682,748714,232,785685,808,000999,0002,510,848
4Oct 8, 2024 07:1683,046720,144,659687,281,0002,000,0002,506,752