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 listNov 14, 2024 02:42zielajzielajScore: 5,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2024 02:425,28168,285,51241,841,0001,992,0002,306,048
2Nov 14, 2024 02:425,28174,842,96441,843,0001,992,0002,469,888
3Nov 14, 2024 02:425,28275,145,25942,841,000996,0002,469,888
4Nov 14, 2024 02:425,28372,369,20242,852,000996,0002,392,064
5Nov 14, 2024 02:425,29368,998,15642,936,000998,0002,465,792
6Nov 14, 2024 02:425,29663,332,77141,958,0001,998,0002,469,888
7Nov 14, 2024 02:425,30068,319,75341,989,0001,999,0002,310,144
8Nov 14, 2024 02:425,31365,586,38443,096,0001,002,0002,465,792
9Nov 14, 2024 02:425,34671,969,63943,364,0001,008,0002,469,888
10Nov 14, 2024 02:426,85481,875,55054,894,0001,996,0002,510,848
11Nov 14, 2024 02:426,89880,129,69556,249,0001,004,0002,510,848
12Nov 14, 2024 02:426,99080,033,05056,017,0002,000,0002,510,848