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 listApr 27, 2024 12:40Steve HanSteve HanScore: 42,570Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 13:2142,434417,852,471352,200,82902,285,568
2Apr 27, 2024 13:2142,528422,472,078352,980,45602,293,760
3Apr 27, 2024 12:3742,538407,526,130353,064,32602,277,376
4Apr 27, 2024 12:3742,548419,764,063353,145,62302,281,472
5Apr 27, 2024 12:3742,570409,192,079353,326,94602,281,472
6Apr 27, 2024 13:2142,579420,058,326353,401,68202,285,568
7Apr 27, 2024 12:4047,069454,941,131390,674,72602,285,568
8Apr 27, 2024 12:4047,171461,933,526391,520,06002,289,664
9Apr 27, 2024 12:4047,187487,404,987391,648,85302,248,704