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:25bruHFTbruHFTScore: 154,567Success
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:25154,4431,311,441,4231,048,080,000233,794,0002,465,792
2Nov 6, 2024 18:25154,5021,305,285,7611,047,485,000234,884,0002,465,792
3Nov 6, 2024 18:25154,5221,308,564,7061,047,617,000234,914,0002,289,664
4Nov 6, 2024 18:25154,5551,310,179,1891,047,025,000235,780,0002,453,504
5Nov 6, 2024 18:25154,5671,309,375,6041,047,106,000235,798,0002,461,696
6Nov 6, 2024 18:25154,5871,310,876,7571,044,246,000238,827,0002,375,680
7Nov 6, 2024 18:25154,5941,311,262,4911,046,291,000236,839,0002,449,408
8Nov 6, 2024 18:25154,9201,312,834,2641,047,053,000238,784,0002,514,944
9Nov 6, 2024 18:25155,0431,322,951,9641,048,071,000238,788,0002,289,664