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 25, 2024 18:11MatthiasMatthiasScore: 8,435Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2024 18:118,41994,298,26267,883,0001,996,0002,519,040
2Nov 25, 2024 18:118,42396,772,16167,914,0001,997,0002,523,136
3Nov 25, 2024 18:118,42493,172,36867,926,0001,997,0002,289,664
4Nov 25, 2024 18:118,42695,642,96167,940,0001,998,0002,285,568
5Nov 25, 2024 18:118,42795,840,47567,947,0001,998,0002,285,568
6Nov 25, 2024 18:118,43494,692,54168,003,0002,000,0002,277,376
7Nov 25, 2024 18:118,43598,177,71868,009,0002,000,0002,285,568
8Nov 25, 2024 18:118,43695,949,73168,016,0002,000,0002,285,568
9Nov 25, 2024 18:118,43691,298,15368,022,0002,000,0002,269,184
10Nov 25, 2024 18:118,44794,256,51369,111,0001,001,0002,289,664
11Nov 25, 2024 18:118,45990,830,90168,201,0002,005,0002,285,568
12Nov 25, 2024 18:118,49093,430,32369,463,0001,006,0002,285,568