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 25, 2024 10:34Steve HanSteve HanScore: 72,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2024 10:3368,294622,886,902566,837,64202,306,048
2Apr 25, 2024 10:3368,923639,143,945572,063,10802,297,856
3Apr 25, 2024 10:3369,416638,944,418576,149,41702,297,856
4Apr 25, 2024 10:3472,639668,177,532602,904,81802,289,664
5Apr 25, 2024 10:3473,133672,268,724607,002,39202,301,952
6Apr 25, 2024 10:3476,141691,975,241631,974,21702,297,856