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 listMay 25, 2025 17:13Alexander KrivolapovAlexander KrivolapovScore: 17,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2025 17:1317,684176,943,875145,777,000998,0002,285,568
2May 25, 2025 17:1317,688176,873,705145,805,0001,005,0002,285,568
3May 25, 2025 17:1317,703177,310,075144,935,0001,999,0002,285,568
4May 25, 2025 17:1317,717175,656,166146,049,0001,000,0002,285,568
5May 25, 2025 17:1317,755170,293,499146,365,0001,002,0002,281,472
6May 25, 2025 17:1317,769176,257,305147,480,00002,363,392
7May 25, 2025 17:1317,774179,807,234147,528,00002,285,568
8May 25, 2025 17:1317,798181,718,012145,728,0001,996,0002,355,200
9May 25, 2025 17:1317,802175,967,190145,760,0001,996,0002,363,392