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 3, 2021 23:29Sergey SamokhvalovSergey SamokhvalovScore: 22,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2021 23:2922,457257,929,057186,395,27002,252,800
2Jul 3, 2021 23:2922,465230,803,235186,458,44302,256,896
3Jul 3, 2021 23:2922,471222,840,060186,513,14102,248,704
4Jul 3, 2021 23:2922,590210,857,928186,494,0001,002,0002,387,968
5Jul 3, 2021 23:2922,592215,678,956187,517,00002,514,944
6Jul 3, 2021 23:2922,592215,972,266186,509,0001,002,0002,502,656
7Jul 3, 2021 23:2922,596212,644,267186,541,0001,002,0002,514,944
8Jul 3, 2021 23:2922,596219,345,577186,545,0001,002,0002,514,944
9Jul 3, 2021 23:2922,603218,527,904187,603,00002,519,040
10Jul 3, 2021 23:2922,605216,927,387186,616,0001,003,0002,514,944
11Jul 3, 2021 23:2922,618213,861,687187,732,00002,514,944
12Jul 3, 2021 23:2922,655217,913,767187,038,0001,000,0002,379,776