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 11, 2024 08:39AndreyAndreyScore: 1,826,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 08:391,825,56415,180,938,83615,072,215,00079,964,0002,281,472
2Nov 11, 2024 08:391,826,01515,190,040,79015,092,948,00062,974,0002,293,760
3Nov 11, 2024 08:391,826,07615,189,874,88915,098,456,00057,978,0002,289,664
4Nov 11, 2024 08:391,826,18515,198,926,45415,075,385,00081,953,0002,293,760
5Nov 11, 2024 08:391,826,52715,194,884,06615,103,198,00056,978,0002,273,280
6Nov 11, 2024 08:391,826,87015,194,668,75715,098,060,00064,961,0002,281,472
7Nov 11, 2024 08:391,833,00715,247,754,47415,142,004,00071,957,0002,289,664
8Nov 11, 2024 08:391,835,62015,270,651,48315,167,686,00067,962,0002,281,472
9Nov 11, 2024 08:391,849,87215,389,842,27315,300,964,00052,975,0002,281,472