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 19:02bruHFTbruHFTScore: 154,563Success
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 19:02154,3621,304,679,0501,046,350,000234,854,0002,273,280
2Nov 6, 2024 19:02154,5631,313,450,8491,047,895,000234,976,0002,498,560
3Nov 6, 2024 19:02155,0441,319,940,6781,047,076,000239,788,0002,289,664