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 listOct 9, 2024 02:21MikeMikeScore: 205,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2024 02:21204,9611,730,077,4841,603,228,00097,952,0002,478,080
2Oct 9, 2024 02:21205,1211,723,035,9961,614,581,00087,922,0002,482,176
3Oct 9, 2024 02:21205,2051,729,181,3661,610,243,00092,956,0002,478,080
4Oct 9, 2024 02:21205,2221,729,519,7011,596,382,000106,958,0002,326,528
5Oct 9, 2024 02:21205,2801,732,152,5541,591,904,000111,922,0002,326,528
6Oct 9, 2024 02:21205,3941,735,947,7441,599,786,000104,985,0002,330,624
7Oct 9, 2024 02:21205,5321,735,460,7091,608,974,00096,938,0002,330,624
8Oct 9, 2024 02:21205,6581,739,553,6691,617,013,00089,945,0002,473,984
9Oct 9, 2024 02:21205,7401,735,306,3711,599,662,000107,977,0002,326,528