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 listJul 2, 2023 19:58dzaimadzaimaScore: 18,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2023 19:5818,314179,724,652151,005,0001,000,0002,260,992
2Jul 2, 2023 19:5818,315177,436,541151,014,0001,000,0002,260,992
3Jul 2, 2023 19:5818,317180,074,513150,031,0002,000,0002,260,992
4Jul 2, 2023 19:5818,319186,620,330150,046,0002,000,0002,260,992
5Jul 2, 2023 19:5818,320183,607,103151,054,0001,000,0002,387,968
6Jul 2, 2023 19:5818,320182,098,596151,056,0001,000,0002,519,040
7Jul 2, 2023 19:5818,323178,440,614150,077,0002,001,0002,260,992
8Jul 2, 2023 19:5818,337181,666,658150,192,0002,002,0002,260,992
9Jul 2, 2023 19:5818,342182,180,802151,235,0001,001,0002,523,136
10Jul 2, 2023 19:5819,420213,298,027161,184,90602,265,088
11Jul 2, 2023 19:5819,426221,049,518161,234,48302,269,184
12Jul 2, 2023 19:5819,430232,560,571161,271,29002,269,184