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 19, 2024 02:28zielajzielajScore: 3,562Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 19, 2024 02:243,54050,997,29929,381,00002,351,104
2Nov 19, 2024 02:283,54049,163,83628,365,0001,013,0002,514,944
3Nov 19, 2024 02:243,55155,602,51028,456,0001,016,0002,347,008
4Nov 19, 2024 02:283,56149,385,30428,541,0001,019,0002,523,136
5Nov 19, 2024 02:283,56257,169,38528,547,0001,019,0002,527,232
6Nov 19, 2024 02:243,59760,880,80827,867,0001,990,0002,523,136
7Nov 19, 2024 02:283,68454,429,42230,577,00002,265,088
8Nov 19, 2024 02:283,69758,402,44630,681,00002,355,200
9Nov 19, 2024 02:283,73154,629,46228,970,0001,997,0002,355,200