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 19, 2021 20:53Yuriy LyfenkoYuriy LyfenkoScore: 17,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2021 20:5317,219170,518,299140,921,0001,998,0002,260,992
2May 19, 2021 20:5317,223169,942,463141,949,000999,0002,260,992
3May 19, 2021 20:5317,226169,372,169139,975,0002,999,0002,392,064
4May 19, 2021 20:5317,227168,323,455140,989,0001,999,0002,396,160
5May 19, 2021 20:5317,229168,085,467141,003,0002,000,0002,392,064
6May 19, 2021 20:5317,237170,946,902142,067,0001,000,0002,260,992
7May 19, 2021 20:5317,249171,252,983141,161,0002,002,0002,527,232
8May 19, 2021 20:5317,275166,141,084142,377,0001,002,0002,260,992
9May 19, 2021 20:5317,351173,306,314141,017,0003,000,0002,506,752
10May 19, 2021 20:5317,965209,197,127149,111,24502,269,184
11May 19, 2021 20:5317,966221,693,907149,118,07702,256,896
12May 19, 2021 20:5317,967205,329,232149,129,89902,269,184