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 listNov 6, 2024 18:39bruHFTbruHFTScore: 155,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 18:39155,3931,317,692,3301,050,994,000238,771,0002,330,624
2Nov 6, 2024 18:39155,4361,316,745,6361,054,280,000235,839,0002,453,504
3Nov 6, 2024 18:39155,4631,313,980,0401,053,465,000236,879,0002,461,696