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:03bruHFTbruHFTScore: 154,489Success
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:03154,0021,302,793,2801,046,357,000231,857,0002,285,568
2Nov 6, 2024 19:03154,0141,307,221,9181,046,442,000231,876,0002,461,696
3Nov 6, 2024 19:03154,1831,307,380,9731,046,952,000232,767,0002,318,336
4Nov 6, 2024 19:03154,2701,308,068,2811,046,546,000233,898,0002,285,568
5Nov 6, 2024 19:03154,4891,311,189,5471,045,399,000236,863,0002,441,216
6Nov 6, 2024 19:03154,5351,314,520,1251,046,705,000235,933,0002,465,792
7Nov 6, 2024 19:03154,5671,307,266,0881,046,108,000236,798,0002,289,664
8Nov 6, 2024 19:03154,6961,312,965,6191,048,168,000235,812,0002,289,664
9Nov 6, 2024 19:03154,8051,312,561,8461,048,089,000236,794,0002,457,600