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 6, 2024 15:37Dan StolyarovDan StolyarovScore: 1,826,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 15:371,825,15515,180,625,31715,073,820,00074,969,0002,281,472
2Nov 6, 2024 15:371,825,92715,184,684,63315,073,223,00081,968,0002,281,472
3Nov 6, 2024 15:371,826,11015,191,065,81715,084,751,00071,965,0002,277,376
4Nov 6, 2024 15:371,826,24115,188,618,92415,078,840,00078,962,0002,281,472
5Nov 6, 2024 15:371,826,25015,183,588,16615,104,899,00052,975,0002,281,472
6Nov 6, 2024 15:371,826,51015,192,543,33415,094,057,00065,974,0002,281,472
7Nov 6, 2024 15:371,827,70515,202,959,87815,108,977,00060,975,0002,281,472
8Nov 6, 2024 15:371,827,85715,201,672,84415,109,238,00061,972,0002,281,472
9Nov 6, 2024 15:371,830,05915,279,207,07815,122,540,00066,949,0002,281,472