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 listFeb 16, 2024 11:00Huy Duc LeHuy Duc LeScore: 19,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 11:0018,996217,094,704157,666,80602,289,664
2Feb 16, 2024 11:0019,002216,288,312157,716,11902,297,856
3Feb 16, 2024 11:0019,004218,742,994157,730,56502,289,664
4Feb 16, 2024 11:0019,767189,055,732162,065,0002,000,0002,285,568
5Feb 16, 2024 11:0019,776193,832,578162,137,0002,001,0002,285,568
6Feb 16, 2024 11:0019,786190,261,685163,222,0001,001,0002,273,280
7Feb 16, 2024 11:0019,787192,699,903162,229,0002,002,0002,265,088
8Feb 16, 2024 11:0019,788190,866,351162,240,0002,002,0002,527,232
9Feb 16, 2024 11:0019,792190,892,137162,268,0002,003,0002,285,568
10Feb 16, 2024 11:0019,796191,308,271164,304,00002,269,184
11Feb 16, 2024 11:0019,799191,540,228162,329,0002,004,0002,523,136
12Feb 16, 2024 11:0019,803195,136,130162,361,0002,004,0002,523,136