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 listDec 6, 2023 02:40Yuriy LyfenkoYuriy LyfenkoScore: 7,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 6, 2023 02:407,24790,407,66756,137,0004,009,0002,433,024
2Dec 6, 2023 02:407,24888,812,66159,160,0001,002,0002,375,680
3Dec 6, 2023 02:407,27282,095,99253,316,0007,041,0002,469,888
4Dec 6, 2023 02:407,28981,883,08559,488,0001,008,0002,273,280
5Dec 6, 2023 02:407,29089,523,22456,475,0004,033,0002,478,080
6Dec 6, 2023 02:407,378125,935,81161,237,25202,252,800
7Dec 6, 2023 02:407,38487,390,08957,272,0004,019,0002,342,912
8Dec 6, 2023 02:407,390135,351,97161,333,93302,236,416
9Dec 6, 2023 02:407,41485,865,02859,518,0002,017,0002,273,280
10Dec 6, 2023 02:407,489117,030,39262,157,60702,289,664
11Dec 6, 2023 02:407,89690,035,07162,510,0003,024,0002,420,736
12Dec 6, 2023 02:408,04896,251,78462,813,0003,988,0002,338,816